Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four

MaRDI QIDQ4901633zbMATH OpenFDO

Authors Juanjuan Duan, Wei Ding, Fei Zhou

Publication date 24 January 2013

zbMATH Keywords

planar graphacyclic edge coloringdischarging methodsintersecting triangle

Mathematics Subject Classification ID

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

Recommendations

• Acyclic edge colorings of planar graphs without 4-cycles
• Acyclic edge coloring of planar graphs without adjacent triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• scientific article; zbMATH DE number 5584824
• Acyclic chromatic index of planar graphs with triangles

Cited in

(3)

• Acyclically 4-colorable triangulations
• Acyclic edge colorings of planar graphs without 4-cycles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

This page was built for publication: Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four

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