Locally boundedk-colorings of trees

DOI10.1051/ro/2009003zbMath1158.05317OpenAlexW2074622067MaRDI QIDQ3621974

Cédric Bentz, Christophe Picouleau

Publication date: 23 April 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105421

zbMATH Keywords

treedynamic programmingbounded graph coloring

Mathematics Subject Classification ID

Dynamic programming (90C39) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restrictions of graph partition problems. I
• A note on the \(m\)-bounded chromatic number of a tree
• Bounded vertex colorings of graphs
• Equitable colorings of bounded treewidth graphs
• Equitable and proportional coloring of trees
• Equitable coloring of trees
• Complexity of list coloring problems with a fixed total number of colors
• Mutual exclusion scheduling
• Feasible edge colorings of trees with cardinality constraints
• Bounded vertex coloring of trees

This page was built for publication: Locally boundedk-colorings of trees