List edge and list total colorings of planar graphs without short cycles
From MaRDI portal
Publication:975488
DOI10.1016/j.ipl.2008.07.003zbMath1189.05061OpenAlexW2007370880MaRDI QIDQ975488
Bin Liu, Jian-Feng Hou, Gui Zhen Liu
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.003
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items
List total coloring of pseudo-outerplanar graphs ⋮ Total coloring of planar graphs without 6-cycles ⋮ List total colorings of planar graphs without triangles at small distance ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ A structural theorem for planar graphs with some applications ⋮ On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ List edge coloring of planar graphs without non-induced 6-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colourings of multigraphs
- Choosability, edge choosability and total choosability of outerplane graphs
- The list chromatic index of a bipartite multigraph
- Some upper bounds on the total and list chromatic numbers of multigraphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
