Star coloring of cubic graphs
From MaRDI portal
Publication:402363
DOI10.1016/J.IPL.2014.05.013zbMATH Open1358.05121OpenAlexW2059293495MaRDI QIDQ402363FDOQ402363
Authors: Dezheng Xie, Huanhuan Xiao, Zhihong Zhao 
Publication date: 28 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.05.013
Recommendations
Cites Work
- Acyclic colorings of planar graphs
- Coloring with no 2-colored \(P_4\)'s
- Star coloring of graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Title not available (Why is that?)
- Star coloring of sparse graphs
- 6-Star-Coloring of Subcubic Graphs
- Title not available (Why is that?)
- The star chromatic numbers of some planar graphs derived from wheels
Cited In (9)
- Star colouring of bounded degree graphs and regular graphs
- One-dependent colorings of the star graph
- Title not available (Why is that?)
- A polyhedral investigation of star colorings
- 6-Star-Coloring of Subcubic Graphs
- Star coloring and tree-width of the Kneser graph \(\mathrm{KG}(n, 2)\)
- The complexity of star colouring in bounded degree graphs and regular graphs
- Star coloring of subcubic graphs
- Star coloring of graphs
This page was built for publication: Star coloring of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402363)
