On sparse graphs with given colorings and homomorphisms
@article{Nesetril2004OnSG, title={On sparse graphs with given colorings and homomorphisms}, author={Jaroslav Nesetril and Xuding Zhu}, journal={J. Comb. Theory, Ser. B}, year={2004}, volume={90}, pages={161-172} }
- Published 2004 in J. Comb. Theory, Ser. B
DOI:10.1016/j.jctb.2003.06.001
From This Paper
Topics from this paper.
Citations
Publications citing this paper.
Showing 1-10 of 29 extracted citations
A combinatorial constraint satisfaction problem dichotomy classification conjecture
View 4 Excerpts
Highly Influenced
A NEW COMBINATORIAL APPROACH TO THE CONSTRAINT SATISFACTION PROBLEM DICHOTOMY CLASSIFICATION
View 6 Excerpts
Highly Influenced
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
View 7 Excerpts
Highly Influenced
A combinatorial classic-sparse graphs with high chromatic number
View 4 Excerpts
Highly Influenced
UNIQUELY D-COLOURABLE DIGRAPHS WITH LARGE GIRTH
View 8 Excerpts
Highly Influenced
BROOKS-TYPE RESULTS FOR COLORING OF DIGRAPHS
View 1 Excerpt
Citation Statistics
81 Citations
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.
See our FAQ for additional information.