The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
From MaRDI portal
Publication:2194528
DOI10.7151/dmgt.2160zbMath1446.05037OpenAlexW2892898247WikidataQ129183989 ScholiaQ129183989MaRDI QIDQ2194528
Lin Sun, Bing Wang, Bin Liu, Jian Liang Wu
Publication date: 26 August 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2160
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the minimum number of choosability of planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- List edge and list total colorings of planar graphs without 4-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Colorings and orientations of graphs
- List edge and list total colourings of multigraphs
- Choosability, edge choosability and total choosability of outerplane graphs
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
- List Total Colourings of Graphs
- Combinatorial Nullstellensatz
- Graphs of degree 4 are 5-edge-choosable
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
