Equitable vertex arboricity of graphs

DOI10.1016/j.disc.2013.08.006zbMath1280.05047arXiv1211.4193OpenAlexW2963979102MaRDI QIDQ394205

Hailuan Li, Xin Zhang, Jian Liang Wu

Publication date: 24 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.4193

zbMATH Keywords

complete bipartite graphplanar graphequitable coloringvertex \(k\)-arboricity\(k\)-tree-coloring

Mathematics Subject Classification ID

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

Equitable vertex arboricity of subcubic graphs ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ On Equitable List Arboricity of Graphs ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Equitable vertex arboricity of 5-degenerate graphs ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ The equitable vertex arboricity of complete tripartite graphs ⋮ Equitable vertex arboricity of planar graphs ⋮ On the equitable vertex arboricity of graphs ⋮ Equitable partition of planar graphs ⋮ 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 ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy ⋮ Equitable partition of graphs into induced forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable \(\Delta\)-coloring of graphs
• On equitable and equitable list colorings of series-parallel graphs
• Equitable colorings of planar graphs with maximum degree at least nine
• Equitable list colorings of planar graphs without short cycles
• Equitable coloring and the maximum degree
• On equitable coloring of bipartite graphs
• A note on relaxed equitable coloring of graphs
• Circular vertex arboricity
• An Ore-type theorem on equitable coloring
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• The Point-Arboricity of Planar Graphs