Pages that link to "Item:Q801935"

The following pages link to Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935):

Displaying 4 items.

• Hamiltonian paths in infinite graphs (Q1196345) (← links)
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
• The complexity of generalized graph colorings (Q1923585) (← links)
• Graph Ramsey theory and the polynomial hierarchy (Q5943091) (← links)