Equitable and proportional coloring of trees

DOI10.1016/0095-8956(83)90017-5zbMath0498.05027DBLPjournals/jct/BollobasG83OpenAlexW2019217570WikidataQ56432142 ScholiaQ56432142MaRDI QIDQ1171064

Béla Bollobás, Richard K. Guy

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90017-5

zbMATH Keywords

equitable coloringequitably 3-colorable

Mathematics Subject Classification ID

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

Related Items (10)

Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Packing \(d\)-degenerate graphs ⋮ Equitable coloring planar graphs with large girth ⋮ EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS ⋮ On the equitable chromatic number of complete \(n\)-partite graphs ⋮ Locally boundedk-colorings of trees ⋮ A note on equitable colorings of forests ⋮ A sufficient condition for equitable edge-colourings of simple graphs ⋮ Equitable colorings of bounded treewidth graphs

Cites Work

• Equipartite colorings in graphs and hypergraphs
• Monthly Research Problems, 1969-75
• Equitable Coloring
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable and proportional coloring of trees