A note on equitable colorings of forests

DOI10.1016/J.EJC.2008.09.017MaRDI QIDQ1024272zbMATH OpenOpenAlexFDO

Authors Gerard Jennhwa Chang

Publication date 17 June 2009

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

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)

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

Cites work

• scientific article; zbMATH DE number 1302199 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Equitable Coloring
• Equitable and proportional coloring of trees
• Equitable coloring of trees
• 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 coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite 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)