Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
From MaRDI portal
Publication:998494
DOI10.1016/J.DISC.2007.12.046zbMath1197.05051OpenAlexW1967419783MaRDI QIDQ998494
Jian-Feng Hou, Jian-Sheng Cai, Gui Zhen Liu
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.046
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Group edge choosability of planar graphs without adjacent short cycles ⋮ 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-choosability of planar graphs without intersecting 4-cycles ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles
Cites Work
- Unnamed Item
- List edge chromatic number of graphs with large girth
- Every planar map is four colorable. I: Discharging
- 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
This page was built for publication: Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
