Edge choosability of planar graphs without small cycles
From MaRDI portal
Publication:1827800
DOI10.1016/j.disc.2004.01.001zbMath1042.05033OpenAlexW2039824936MaRDI QIDQ1827800
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.001
Related Items (12)
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ Edge DP-coloring in planar graphs ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ An introduction to the discharging method via graph coloring ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ Structural properties and edge choosability of planar graphs without 4-cycles ⋮ Edge-choosability of planar graphs without adjacent triangles or without 7-cycles ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ List edge coloring of planar graphs without non-induced 6-cycles
Cites Work
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- List edge chromatic number of graphs with large girth
- Edge-choosability in line-perfect multigraphs
- Edge-choosability of multicircuits
- List edge and list total colourings of multigraphs
- Choosability and edge choosability of planar graphs without five cycles
- The list chromatic index of a bipartite multigraph
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Graphs of degree 4 are 5-edge-choosable
This page was built for publication: Edge choosability of planar graphs without small cycles
