A note on r-equitable k-colorings of trees

DOI10.2298/YJOR130704039HMaRDI QIDQ2975438zbMATH OpenOpenAlexFDO

Authors Alain Hertz, Bernard Ries

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

equitable coloringindependent setstrees

Mathematics Subject Classification ID

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

Recommendations

• Equitable coloring of trees
• Equitable vertex arboricity of graphs
• On r-equitable coloring of complete multipartite graphs
• On \(r\)-equitable colorings of bipartite graphs
• scientific article; zbMATH DE number 2079370

Cited in

(5)

• Equitable coloring of trees
• \((N, p)\)-equitable \(b\)-coloring of graphs
• scientific article; zbMATH DE number 6376879 (Why is no real title available?)
• On r-equitable chromatic threshold of Kronecker products of complete graphs
• Colourings of (k-r,k)-trees

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

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