A note on edge-choosability of planar graphs without intersecting 4-cycles

DOI10.1007/S12190-010-0408-5MaRDI QIDQ545596zbMATH OpenOpenAlexFDO

Authors Jiansheng Cai, Qiaoling Ma, Jihui Wang, Sumei Zhang

Publication date 22 June 2011

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-010-0408-5

zbMATH Keywords

choosabilitycycleedge-coloringplanar graphchordcombinatorial problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Edge-choosability of planar graphs without chordal 7-cycles.
• Edge-choosability of planar graphs without non-induced 5-cycles
• Edge-choosability of planar graphs without chordal 6-cycles
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
• A note on list edge coloring of planar graphs without adjacent short cycles.

Cites work

• A Note on Edge Choosability and Degeneracy of Planar Graphs
• 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 planar graphs without adjacent triangles or without 7-cycles
• Graphs of degree 4 are 5-edge-choosable
• List edge and list total colorings of planar graphs without 4-cycles
• List edge and list total colorings of planar graphs without short cycles
• List edge and list total colourings of multigraphs
• List edge chromatic number of graphs with large girth
• List-colourings of graphs
• 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

(5)

• The 4-choosability of planar graphs and cycle adjacency
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• Structural properties and edge choosability of planar graphs without 4-cycles
• scientific article; zbMATH DE number 2172647 (Why is no real title available?)
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: A note on edge-choosability of planar graphs without intersecting 4-cycles

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