Acyclic total colorings of planar graphs without \(l\) cycles
From MaRDI portal
Publication:475741
DOI10.1007/s10114-011-8640-yzbMath1305.05084MaRDI QIDQ475741
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Acyclic total colorings of planar graphs without \(l\) cycles
- About acyclic edge colourings of planar graphs
- Total colorings of planar graphs without adjacent triangles
- On acyclic colorings of planar graphs
- Algorithmic aspects of acyclic edge colorings
- Total colourings of graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- A 3-color theorem on plane graphs without 5-circuits
- 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
- Acyclic colorings of planar graphs