Acyclic coloring of graphs with some girth restriction
From MaRDI portal
Publication:281769
DOI10.1007/S10878-015-9829-2zbMATH Open1339.05117OpenAlexW2057784932MaRDI QIDQ281769FDOQ281769
Authors: Jiansheng Cai, Binlu Feng, Guiying Yan 
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9829-2
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
- Graph theory with applications
- Acyclic colorings of planar graphs
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Graph colouring and the probabilistic method
- Generalised acyclic edge colourings of graphs with large girth
- Acyclic coloring of graphs and entropy compression method
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
- Title not available (Why is that?)
- Improved upper bound for acyclic chromatic number of graphs.
- On the acyclic chromatic number of Hamming graphs
- Title not available (Why is that?)
- 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)
