A note on the \(m\)-bounded chromatic number of a tree

DOI10.1006/EUJC.1993.1034zbMath0781.05019OpenAlexW2062597384MaRDI QIDQ685308

Bor-Liang Chen, Ko-Wei Lih

Publication date: 17 October 1993

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

Full work available at URL: https://doi.org/10.1006/eujc.1993.1034

zbMATH Keywords

treeindependence numbercoloringcolormaximum degree\(m\)-bounded chromatic number

Mathematics Subject Classification ID

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

Related Items (1)

Locally boundedk-colorings of trees

This page was built for publication: A note on the \(m\)-bounded chromatic number of a tree