Equitable vertex arboricity of 5-degenerate graphs
From MaRDI portal
Publication:2410094
DOI10.1007/s10878-016-9997-8zbMath1376.05051OpenAlexW2273769553MaRDI QIDQ2410094
Songling Shan, Guantao Chen, Jian Liang Wu, Yu-ping Gao, Guang-Hui Wang
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-9997-8
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Complexity of tree-coloring interval graphs equitably ⋮ Tree-coloring problems of bounded treewidth graphs ⋮ Equitable partition of graphs into induced linear forests ⋮ Equitable partition of plane graphs with independent crossings into induced forests
Cites Work
- Unnamed Item
- Unnamed Item
- Equitable vertex arboricity of graphs
- Equitable \(\Delta\)-coloring of graphs
- Equitable vertex arboricity of planar graphs
- On equitable and equitable list colorings of series-parallel graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- Equitable partition of graphs into induced forests
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- A conjecture on equitable vertex arboricity of graphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Critical Point-Arboritic Graphs
- Equitable Coloring
- The Point-Arboricity of Planar Graphs
This page was built for publication: Equitable vertex arboricity of 5-degenerate graphs
