13 problems
For positive integers and with , let be the Kneser graph and let denote the circular chromatic number of a graph . Johnson…
Circular chromatic index conjecture. The graph satisfies
Let be a signed graph whose underlying graph is , with every edge negative, and let denote the complete graph on vertices with every edge negative. A…
Circular-colouring density conjecture. If has no -colouring, then there exist positive rational numbers and , depending on and , such…
Chang–Huang–Zhu conjecture. Whenever ,
DP-completeness conjecture. The problem is DP-complete.
Let and be graphs, let be their categorical product, and let denote the circular chromatic number. Zhu's circular chromatic conjecture. For any grap…
Let and be signed graphs, and let denote their tensor (direct) product, whose vertices and are adjacent when…
Let be a signed bipartite planar graph, let be the signed subdivision of , and write for the corresponding signed homomorphism…
Let be a positive integer, and let denote the class of signed bipartite planar graphs with the indicated girth condition. Bipartite analogue of the Jaeger–…
Let be a prime, and let be the smallest number such that every planar graph of girth with no cycles of lengths from through admits a homomorphism t…
Let be a positive integer and let be a planar graph of girth at least . The circular chromatic conjecture. … The cases and follow from the Four Color Theore…
Let be the set of circular edge chromatic numbers of graphs. Zhu's accumulation-point conjecture. Integers…