Acyclic edge coloring of planar graphs without adjacent cycles

DOI10.1007/S11425-013-4644-7MaRDI QIDQ2445495zbMATH OpenOpenAlexFDO

Authors Min Wan, Baogang Xu

Publication date 14 April 2014

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-013-4644-7

zbMATH Keywords

acyclic edge coloringadjacent cyclesplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Acyclic edge coloring of planar graphs without adjacent triangles
• Acyclic edge coloring of planar graphs without cycles of specific lengths
• The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
• Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
• Acyclic edge colorings of planar graphs without 4-cycles

Cites work

• Acyclic coloring of graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge coloring of planar graphs without small cycles
• Acyclic edge coloring of subcubic graphs
• Acyclic edge colorings of graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic Edge Colouring of Outerplanar Graphs
• Acyclic edge-coloring of planar graphs
• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• scientific article; zbMATH DE number 1775440 (Why is no real title available?)
• The acyclic edge chromatic number of a random d‐regular graph is d + 1

Cited in

(8)

• Acyclic chromatic index of planar graphs with triangles
• Acyclic edge coloring of planar graphs without cycles of specific lengths
• Bipartition of graph under degree constraints
• scientific article; zbMATH DE number 6178442 (Why is no real title available?)
• Acyclic edge coloring of planar graphs without adjacent triangles
• Incidence coloring of planar graphs without adjacent small cycles
• Acyclic coloring of graphs without bichromatic long path
• About acyclic edge colourings of planar graphs

This page was built for publication: Acyclic edge coloring of planar graphs without adjacent cycles

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