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

DOI10.1006/EUJC.1993.1034zbMATH Open0781.05019OpenAlexW2062597384MaRDI QIDQ685308FDOQ685308

Authors 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

treemaximum degreecoloringindependence numbercolor\(m\)-bounded chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Bounded vertex coloring of trees
• Bounded vertex colorings of graphs
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
• \(B\)-chromatic number of cacti
• scientific article; zbMATH DE number 2014472

Cited in

(4)

• Locally boundedk-colorings of trees
• Exact values for theb-chromatic number of a power completek-ary tree
• Bounded vertex coloring of trees
• Equitable and \(m\)-bounded coloring of split graphs

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

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