Pages that link to "Item:Q5143707"
From MaRDI portal
The following pages link to A conjecture on edge coloring of graphs (Q5143707):
Displaying 10 items.
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
- On resolving edge colorings in graphs (Q1415146) (← links)
- Some results on an edge coloring problem of Folkman and Fulkerson (Q1587594) (← links)
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
- (Q3987044) (← links)
- (Q4014299) (← links)
- (Q4870406) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)