Equitable colorings of bounded treewidth graphs
From MaRDI portal
Publication:817768
DOI10.1016/j.tcs.2005.09.027zbMath1086.68096WikidataQ59567836 ScholiaQ59567836MaRDI QIDQ817768
Hans L. Bodlaender, Fedor V. Fomin
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.027
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Decomposition, reformulation, and diving in university course timetabling, Locally boundedk-colorings of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
- A note on the decomposition of graphs into isomorphic matchings
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Chromatic optimisation: Limitations, objectives, uses, references
- Equitable and proportional coloring of trees
- NP-completeness of graph decomposition problems
- Equitable coloring of trees
- Mutual exclusion scheduling
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Edge dominating set and colorings on graphs with fixed clique-width
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Complexity Results for Bandwidth Minimization
- The χt-coloring problem
- The $L(2,1)$-Labeling Problem on Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- On Equitable Coloring of d-Degenerate Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Automata, Languages and Programming
- Bounded vertex coloring of trees
