Edge choosability of planar graphs without short cycles

MaRDI QIDQ880873zbMATH OpenFDO

Authors Weifan Wang

Publication date 29 May 2007

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

planar graphchromatic indexedge-\(k\)-choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge choosability of planar graphs without 5-cycles with a chord
• Choosability and edge choosability of planar graphs without five cycles
• Edge choosability of planar graphs without small cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• Edge-choosability of planar graphs without chordal 6-cycles

Cited in

(14)

• A note on edge-group choosability of planar graphs without 5-cycles
• scientific article; zbMATH DE number 2172647 (Why is no real title available?)
• Edge choosability of planar graphs without 5-cycles with a chord
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Edge-choosability of planar graphs without non-induced 5-cycles
• Edge choosability of planar graphs without small cycles
• Structural properties and edge choosability of planar graphs without 4-cycles
• Group edge choosability of planar graphs without adjacent short cycles
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• A Note on Edge Choosability and Degeneracy of Planar Graphs
• Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
• Choosability and edge choosability of planar graphs without five cycles
• Structural properties and edge choosability of planar graphs without 6-cycles
• Planar graphs without cycles of specific lengths

This page was built for publication: Edge choosability of planar graphs without short cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880873)