8 problems
DP-completeness conjecture. The problem is DP-complete.
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 positive integer, and let denote the class of signed planar graphs with the indicated girth condition. Jaeger–Zhang conjecture. … This conjectur…
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…
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…