List edge coloring of planar graphs without non-induced 6-cycles

DOI10.1007/s00373-014-1420-6zbMath1317.05051OpenAlexW2032990027MaRDI QIDQ2354599

Jian-Sheng Cai

Publication date: 20 July 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1420-6

zbMATH Keywords

combinatorial problemplanar graphcoloringchoosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords

Cites Work

• Unnamed Item
• List edge and list total colorings of planar graphs without 4-cycles
• Total colorings of planar graphs without small cycles
• List edge and list total colorings of planar graphs without short 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
• 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

This page was built for publication: List edge coloring of planar graphs without non-induced 6-cycles