list coloring conjecture

E1654975 UNEXPLORED

The list coloring conjecture is a major open problem in graph theory asserting that for every multigraph, the minimum number of colors needed for a proper edge coloring equals the minimum list size that guarantees a proper edge coloring from arbitrary color lists.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
list coloring conjecture canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Alon–Tarsi conjecture → relatedConjecture → list coloring conjecture ⓘ