A note on equitable colorings of forests

DOI10.1016/J.EJC.2008.09.017zbMATH Open1220.05037arXivmath/0407235OpenAlexW2075760198MaRDI QIDQ1024272FDOQ1024272

Authors: Gerard Jennhwa Chang 

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

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

zbMATH Keywords

forestequtiable coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Equitable Coloring
• Equitable and proportional coloring of trees
• Equitable coloring of trees
• Title not available (Why is that?)
• Monthly Research Problems, 1969-75

Cited In (5)

• Gap one bounds for the equitable chromatic number of block graphs
• On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable colorings of Cartesian products of graphs

This page was built for publication: A note on equitable colorings of forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024272)