The average degree of a multigraph critical with respect to edge or total choosability
From MaRDI portal
Publication:966012
DOI10.1016/j.disc.2009.11.011zbMath1230.05104MaRDI QIDQ966012
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.011
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
Related Items
Maximum average degree of list-edge-critical graphs and Vizing's conjecture, List-Coloring Claw-Free Graphs with $\Delta-1$ Colors, An introduction to the discharging method via graph coloring, List coloring the square of sparse graphs with large degree, List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colourings of multigraphs
- On the size of edge chromatic critical graphs
- Total colorings of degenerate graphs
- The average degree of an edge-chromatic critical graph
- Some totally 4-choosable multigraphs
- List Total Colourings of Graphs
- The average degree of an edge‐chromatic critical graph II