Acyclic coloring of graphs with some girth restriction
From MaRDI portal
(Redirected from Publication:281769)
Recommendations
- Improved upper bound for acyclic chromatic number of graphs.
- The generalized acyclic chromatic number of graphs with large girth
- Improved upper bound for generalized acyclic chromatic number of graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic edge colourings of graphs with large girth
Cites work
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- Acyclic coloring of graphs
- Acyclic coloring of graphs and entropy compression method
- Acyclic colorings of planar graphs
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Generalised acyclic edge colourings of graphs with large girth
- Graph colouring and the probabilistic method
- Graph theory with applications
Cited in
(13)- Hardness transitions and uniqueness of acyclic colouring
- Generalised acyclic edge colourings of graphs with large girth
- Improved upper bound for generalized acyclic chromatic number of graphs
- scientific article; zbMATH DE number 1341902 (Why is no real title available?)
- Improved upper bound for acyclic chromatic number of graphs.
- On the acyclic chromatic number of Hamming graphs
- scientific article; zbMATH DE number 2140684 (Why is no real title available?)
- A note on acyclic vertex-colorings
- Acyclic colouring of some line graphs
- Acyclic coloring of graphs with maximum degree at most six
- Acyclic Colourings of Planar Graphs with Large Girth
- The generalized acyclic chromatic number of graphs with large girth
- Acyclic coloring of graphs
This page was built for publication: Acyclic coloring of graphs with some girth restriction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281769)
