Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles

DOI10.1017/S0963548301004576zbMath0982.05046MaRDI QIDQ2731587

Ko-Wei Lih, Wang Weifan

Publication date: 29 March 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

edge coloringplanar graphedge list coloringlist chromatic indexconjecture of Vizing

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ Planar graphs without cycles of specific lengths ⋮ 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 ⋮ Edge choosability of planar graphs without small cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles

This page was built for publication: Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles