A note on equitable colorings of forests

2004/07/14 by Gerard J. Chang, Chang, Gerard J. · 1 citation
Computer Science · Mathematics · #05C05 #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C05 #msc:05C15

paper · pdf · doi:10.48550/arxiv.math/0407235

5 pages

arxiv created 2004/07/14 · openalex publication_date 2004/07/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note gives a short proof on characterizations of a forest to be equitably k-colorable.

Cited by

• Equitably Coloring Planar and Outerplanar Graphs

Related

• Equitable vertex arboricity conjecture holds for graphs with low\n degeneracy
• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
• The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs
• On the Equitable Vertex Arboricity of Graphs
• Equitable vertex arboricity of graphs