Circular vertex arboricity
From MaRDI portal
Publication:2275930
DOI10.1016/j.dam.2011.04.009zbMath1223.05243OpenAlexW2029126484MaRDI QIDQ2275930
Shan Zhou, Jian Liang Wu, Gui Zhen Liu, Guang-Hui Wang
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.009
Related Items (4)
Equitable vertex arboricity of graphs ⋮ Unnamed Item ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ The star dichromatic number
Cites Work
- Unnamed Item
- Vertex arboricity of integer distance graph \(G(D_{m,k})\)
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Homomorphisms from sparse graphs with large girth.
- Every planar graph has an acyclic 8-coloring
- Vertex arboricity and maximum degree
- On the vertex-arboricity of planar graphs
- The point-arboricity of a graph
- On the critical point-arboricity graphs
- A note on the star chromatic number
- Fractional Vertex Arboricity of Graphs
- Critical Point-Arboritic Graphs
- Circular chromatic number and Mycielski graphs
- Acyclic colorings of planar graphs
- Circular chromatic number: A survey
This page was built for publication: Circular vertex arboricity
