scientific article; zbMATH DE number 7790331

MaRDI QIDQ6177586zbMATH OpenFDO

Authors Joshua Harrelson, Jessica McDonald

Publication date 17 January 2024

Full work available at URL https://arxiv.org/abs/1909.01260, http://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p127.pdf

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Colorings and orientations of graphs
• Computing the list chromatic index of graphs
• Every planar graph with maximum degree 7 is of class 1
• Fast generation of planar graphs
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• List edge and list total colourings of multigraphs
• List edge colourings of some 1-factorable multigraphs
• List Total Colourings of Graphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• On kernel-perfect orientations of line graphs
• Planar graphs of maximum degree seven are Class I
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
• Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
• The list-chromatic index of \(K_6\)
• The NP-Completeness of Edge-Coloring

Describes a project that uses

Uses Software

• SageMath

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177586)