Edge-choosability of planar graphs without non-induced 5-cycles

DOI10.1016/J.IPL.2008.12.001MaRDI QIDQ976112zbMATH OpenOpenAlexFDO

Authors Xia Zhang, Jiansheng Cai, Jianfeng Hou, Guizhen Liu

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.12.001

zbMATH Keywords

choosabilitycycleedge-coloringplanar graphcombinatorial problemschord

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Choosability and edge choosability of planar graphs without five cycles
• Edge choosability of planar graphs without 5-cycles with a chord
• A note on edge-group choosability of planar graphs without 5-cycles
• Edge choosability of planar graphs without small cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Edge choosability of planar graphs without short cycles
• Acyclic 5-choosability of planar graphs without small cycles
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• scientific article; zbMATH DE number 6914816

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• 25 pretty graph colouring problems
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Choosability and edge choosability of planar graphs without five cycles
• Choosability, edge choosability and total choosability of outerplane graphs
• Edge choosability of planar graphs without small cycles
• Edge-choosability of multicircuits
• Graphs of degree 4 are 5-edge-choosable
• List edge and list total colourings of multigraphs
• List edge chromatic number of graphs with large girth
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Structural properties and edge choosability of planar graphs without 4-cycles
• Structural properties and edge choosability of planar graphs without 6-cycles
• The list chromatic index of a bipartite multigraph

Cited in

(11)

• scientific article; zbMATH DE number 6914816 (Why is no real title available?)
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• List edge coloring of planar graphs without 6-cycles with two chords
• A note on edge-choosability of planar graphs without intersecting 4-cycles
• Planar graphs without intersecting 5-cycles are signed-4-choosable
• Edge-choosability of planar graphs without chordal 6-cycles
• Edge-choosability of planar graphs without chordal 7-cycles.
• A note on edge-group choosability of planar graphs without 5-cycles
• Choosability and edge choosability of planar graphs without five cycles
• List edge coloring of planar graphs without non-induced 6-cycles
• List-edge-coloring of planar graphs without 6-cycles with three chords

This page was built for publication: Edge-choosability of planar graphs without non-induced 5-cycles

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