Pages that link to "Item:Q743657"
From MaRDI portal
The following pages link to Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657):
Displayed 7 items.
- The tournament scheduling problem with absences (Q323410) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- The Alon-Tarsi conjecture: a perspective on the main results (Q2319705) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)