A Note on Edge Choosability and Degeneracy of Planar Graphs

DOI10.1007/978-3-642-02026-1_23MaRDI QIDQ3637072zbMATH OpenOpenAlexFDO

Authors Baoyindureng Wu, Xinhui An

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_23

zbMATH Keywords

list coloringplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Edge choosability of planar graphs without short cycles
• Choosability and edge choosability of planar graphs without five cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• Edge-choosability of planar graphs without chordal 6-cycles
• scientific article; zbMATH DE number 5914884

Cited in

(3)

• The edge-face choosability of plane graphs
• Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
• A note on edge-choosability of planar graphs without intersecting 4-cycles

This page was built for publication: A Note on Edge Choosability and Degeneracy of Planar Graphs

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