A note on r-equitable k-colorings of trees

DOI10.2298/YJOR130704039HzbMath1464.05151OpenAlexW2048023919MaRDI QIDQ2975438

Bernard Ries, Alain Hertz

Publication date: 11 April 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor130704039h

zbMATH Keywords

treesindependent setsequitable coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

\((N, p)\)-equitable \(b\)-coloring of graphs ⋮ On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs

This page was built for publication: A note on r-equitable k-colorings of trees