Maximum average degree of list-edge-critical graphs and Vizing's conjecture

DOI10.5614/ejgta.2022.10.2.4zbMath1499.05100OpenAlexW4308003253WikidataQ122914888 ScholiaQ122914888MaRDI QIDQ5054037

Hannah Reavis, Joshua Harrelson

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.2.4

zbMATH Keywords

dischargingmaximum average degreelist-edge-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

Total coloring conjecture on certain classes of product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
• The average degree of a multigraph critical with respect to edge or total choosability
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• List edge and list total colourings of multigraphs
• List-edge-colouring planar graphs with precoloured edges
• The list chromatic index of a bipartite multigraph
• Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
• List Total Colourings of Graphs

This page was built for publication: Maximum average degree of list-edge-critical graphs and Vizing's conjecture