Acyclic total colorings of planar graphs without l cycles

DOI10.1007/S10114-011-8640-YzbMATH Open1305.05084OpenAlexW2068087335MaRDI QIDQ475741FDOQ475741

Authors: Xiang Yong Sun, Jian-Liang Wu 

Publication date: 27 November 2014

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-8640-y

Recommendations

• Acyclic total colorings of planar graphs.
• A note on acyclic total coloring of plane graphs.
• Total coloring of planar graphs without 6-cycles
• A note on total colorings of planar graphs without 4-cycles
• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles

zbMATH Keywords

cycleplanar graphacyclic total coloring

Mathematics Subject Classification ID

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

Cites Work

• On acyclic colorings of planar graphs
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic colorings of planar graphs
• Total colourings of graphs
• Acyclic edge colorings of graphs
• On the total coloring of planar graphs.
• Acyclic coloring of graphs
• On total 9-coloring planar graphs of maximum degree seven
• Title not available (Why is that?)
• Total colorings of planar graphs without adjacent triangles
• Title not available (Why is that?)
• About acyclic edge colourings of planar graphs
• Algorithmic aspects of acyclic edge colorings
• A 3-color theorem on plane graphs without 5-circuits
• Acyclic total colorings of planar graphs without \(l\) cycles

Cited In (2)

• Acyclic coloring of graphs without bichromatic long path
• Acyclic total colorings of planar graphs without \(l\) cycles

This page was built for publication: Acyclic total colorings of planar graphs without \(l\) cycles

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