Edge-choosability of planar graphs without non-induced 5-cycles
From MaRDI portal
Publication:976112
DOI10.1016/j.ipl.2008.12.001zbMath1189.05058OpenAlexW2024763003MaRDI QIDQ976112
Xia Zhang, Gui Zhen Liu, Jian-Sheng Cai, Jian-Feng Hou
Publication date: 16 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.12.001
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ A note on edge-group choosability of planar graphs without 5-cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles
Cites Work
- Unnamed Item
- Structural properties and edge choosability of planar graphs without 4-cycles
- List edge chromatic number of graphs with large girth
- Edge-choosability of multicircuits
- List edge and list total colourings of multigraphs
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- The list chromatic index of a bipartite multigraph
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
- 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
- Graphs of degree 4 are 5-edge-choosable
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- 25 pretty graph colouring problems
