Bounded vertex coloring of trees

DOI10.1016/S0012-365X(00)00345-9zbMath0979.05042OpenAlexW1975011389WikidataQ127673543 ScholiaQ127673543MaRDI QIDQ5937457

Mark Jarvis, Bing Zhou

Publication date: 17 February 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00345-9

zbMATH Keywords

treesbounded chromatic numberbounded coloring

Mathematics Subject Classification ID

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

Related Items (11)

Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ Bounded max-colorings of graphs ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Partitioning a weighted partial order ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Scheduling jobs on identical machines with agreement graph ⋮ Partitioning graphs into induced subgraphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. I ⋮ Locally boundedk-colorings of trees ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ Equitable colorings of bounded treewidth graphs

This page was built for publication: Bounded vertex coloring of trees