A note on list edge and list total coloring of planar graphs without adjacent short cycles
From MaRDI portal
Publication:2440495
DOI10.1007/s10114-013-2419-2zbMath1283.05112OpenAlexW2069127964MaRDI QIDQ2440495
Publication date: 18 March 2014
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-013-2419-2
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- On the total choosability of planar graphs and of sparse graphs
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- Total choosability of planar graphs with maximum degree 4
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without short cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List edge and list total colourings of multigraphs
- Choosability, edge choosability and total choosability of outerplane graphs
- List total colorings of planar graphs without triangles at small distance
- Some upper bounds on the total and list chromatic numbers of multigraphs