Acyclic total colorings of planar graphs without l cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- scientific article; zbMATH DE number 2192154 (Why is no real title available?)
- A 3-color theorem on plane graphs without 5-circuits
- About acyclic edge colourings of planar graphs
- Acyclic coloring of graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic colorings of planar graphs
- Acyclic edge colorings of graphs
- Acyclic total colorings of planar graphs without \(l\) cycles
- Algorithmic aspects of acyclic edge colorings
- On acyclic colorings of planar graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs without adjacent triangles
- Total colourings of graphs
Cited in
(4)
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)