Pages that link to "Item:Q743657"

The following pages link to Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657):

Displaying 13 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)
• Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices (Q6084712) (← links)
• Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs (Q6108003) (← links)
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
• On the Alon-Tarsi number of semi-strong product of graphs (Q6181341) (← links)
• Edge-colouring graphs with local list sizes (Q6187343) (← links)