Computing the list chromatic index of graphs

DOI10.1016/j.jda.2018.11.014zbMath1403.05150OpenAlexW2901342790WikidataQ128927099 ScholiaQ128927099MaRDI QIDQ1711669

Uwe Schauz

Publication date: 18 January 2019

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.11.014

zbMATH Keywords

one-factorizationscombinatorial algorithmscombinatorial nullstellensatzedge coloringslist edge coloring conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (max. 100)

Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ Unnamed Item

Uses Software

• SageMath
• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• The list chromatic index of a bipartite multigraph
• Asymptotically good list-colorings
• Mr. Paint and Mrs. Correct
• The list-chromatic index of \(K_6\)
• List edge colourings of some 1-factorable multigraphs
• Fast generation of regular graphs and construction of cages
• Combinatorial Nullstellensatz
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs

This page was built for publication: Computing the list chromatic index of graphs