On acyclic edge coloring of planar graphs without intersecting triangles

DOI10.1016/J.DISC.2011.07.023MaRDI QIDQ409363zbMATH OpenOpenAlexFDO

Authors Ping Sheng, Yingqian Wang

Publication date 13 April 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

planar graphacyclic edge coloringintersecting triangles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic chromatic index of planar graphs with triangles
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of sparse graphs

Cites work

• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• scientific article; zbMATH DE number 5584824 (Why is no real title available?)
• About acyclic edge colourings of planar graphs
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge colorings of graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge colouring of planar graphs without short cycles
• Graph theory
• Some results on acyclic edge coloring of plane graphs

Cited in

(10)

• Acyclic edge coloring of triangle-free toroidal graphs
• Acyclic edge coloring of graphs
• Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
• Total colorings of planar graphs without adjacent triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• The number of colorings of planar graphs with no separating triangles
• Acyclic chromatic index of planar graphs with triangles
• Triangle edge deletion on planar glasses-free RGB-digraphs
• Acyclic edge coloring of sparse graphs

This page was built for publication: On acyclic edge coloring of planar graphs without intersecting triangles

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