Edge choosability of planar graphs without 5-cycles with a chord

DOI10.1016/j.disc.2008.04.056zbMath1198.05043OpenAlexW2073276268MaRDI QIDQ1025481

Yongzhu Chen, Weiyi Zhu, Wei Fan Wang

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.056

zbMATH Keywords

cycleplane graphchordedge choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

On group choosability of total graphs ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• Edge choosability of planar graphs without short cycles
• 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 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
• 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: Edge choosability of planar graphs without 5-cycles with a chord