Author:
Hell Pavol,Nešetřil Jaroslav
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Homomorphisms of 3-chromatic graphs, II;Albertson,1985
2. On unavoidable digraphs in orientations of graphs;Bloom;J. Graph Theory,1987
3. On minimal graphs;Fellner;Theoret. Comput. Sci.,1982
4. The complexity of near-optimal graph coloring;Garey;J. Assoc. Comput. Mach.,1976
5. An application of graph coloring to printed circuit testing;Garey;IEEE Trans. Circuits and Systems,1976
Cited by
530 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Complexity of Symmetric vs. Functional PCSPs;ACM Transactions on Algorithms;2024-08-05
2. Moduli spaces of geometric graphs;Algebraic & Geometric Topology;2024-07-16
3. Injective hardness condition for PCSPs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
4. 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
5. Quantum advantage and CSP complexity;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08