Acyclic edge coloring of planar graphs without adjacent triangles

DOI10.3770/J.ISSN:2095-2651.2012.04.004MaRDI QIDQ4927751zbMATH OpenFDO

Authors Dezheng Xie, Yanqing Wu

Publication date 20 June 2013

zbMATH Keywords

planar graphacyclic edge coloringacyclic edge chromatic number

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(10)

• Acyclic edge coloring of triangle-free toroidal graphs.
• Acyclic edge coloring of planar graphs without adjacent cycles
• Acyclic edge coloring of triangle-free toroidal graphs
• Acyclic edge coloring of IC-planar graphs
• Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four
• Acyclic edge coloring of triangle-free 1-planar graphs
• Total colorings of planar graphs without adjacent triangles
• Acyclic chromatic index of planar graphs with triangles
• Triangle edge deletion on planar glasses-free RGB-digraphs
• Acyclic edge coloring of planar graphs without cycles of specific lengths

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

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