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

DOI10.1016/J.DISC.2008.04.056zbMATH Open1198.05043OpenAlexW2073276268MaRDI QIDQ1025481FDOQ1025481

Authors: Yongzhu Chen, Weiyi Zhu, Weifan 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

Recommendations

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

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)

Cites Work

• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• Multicriterial graph problems with MAXMIN criterion
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Choosability, edge choosability and total choosability of outerplane graphs
• Choosability and edge choosability of planar graphs without five cycles
• Structural properties and edge choosability of planar graphs without 6-cycles
• Edge-choosability of multicircuits
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• Edge choosability of planar graphs without small cycles
• Graphs of degree 4 are 5-edge-choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• List edge chromatic number of graphs with large girth
• Edge choosability of planar graphs without short cycles

Cited In (9)

• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• Edge-choosability of planar graphs without non-induced 5-cycles
• Planar graphs without chordal 5-cycles are 2-good
• Two Chromatic Conjectures: One for Vertices and One for Edges
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
• On group choosability of total graphs
• Choosability and edge choosability of planar graphs without five cycles
• Graphs of degree 4 are 5-edge-choosable
• Edge choosability of planar graphs without short cycles

This page was built for publication: Edge choosability of planar graphs without 5-cycles with a chord

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