Graphs with maximum degreee 5 are acyclically 7-colorable
From MaRDI portal
Recommendations
- Acyclic coloring of graphs of maximum degree
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Graphs with maximum degree 6 are acyclically 11-colorable
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
- Acyclic coloring of graphs with maximum degree 7
Cited in
(22)- Graphs with maximum degree 6 are acyclically 11-colorable
- Acyclic improper colouring of graphs with maximum degree 4
- Acyclic choosability of graphs with bounded degree
- Acyclic coloring of claw-free graphs with small degree
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- Acyclic coloring of graphs and entropy compression method
- Acyclic coloring of graphs with maximum degree at most six
- The \(r\)-acyclic chromatic number of planar graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic vertex coloring of graphs of maximum degree six
- Acyclically 4-colorable triangulations
- Acyclic coloring of graphs with maximum degree 7
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
- Planarization and acyclic colorings of subcubic claw-free graphs
- Acyclic coloring of graphs of maximum degree
- Acyclic coloring with few division vertices
- Acyclic coloring of graphs
- The Alcuin number of graphs with maximum degree five
- Hardness transitions and uniqueness of acyclic colouring
- Acyclic vertex coloring of graphs of maximum degree 5
- Locally irregular total colorings of graphs
- Acyclic improper colourings of graphs with bounded maximum degree
This page was built for publication: Graphs with maximum degreee 5 are acyclically 7-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119066)
