Equitable colorings of bounded treewidth graphs

Authors:
Hans L. Bodlaender;Fedor V. Fomin
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, TB Utrecht, The Netherlands;Department of Informatics, University of Bergen, Norway
Venue:
Theoretical Computer Science - Graph colorings
Year:
2005

Citing 21
Cited 9

The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

SIAM Journal on Algebraic and Discrete Methods
An existential problem of a weight-controlled subset and its application to school timetable construction

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
NP-completeness of graph decomposition problems

Journal of Complexity
Bounded vertex colorings of graphs

Discrete Mathematics
Equitable coloring of trees

Journal of Combinatorial Theory Series B
Restrictions of graph partition problems. Part I

Theoretical Computer Science
The $L(2,1)$-Labeling Problem on Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
Mutual exclusion scheduling

Theoretical Computer Science
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Scheduling with conflicts, and applications to traffic signal control

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Bounded vertex coloring of trees

Discrete Mathematics
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics
Equitable and m-Bounded Coloring of Split Graphs

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
On Complexity of Some Chain and Antichain Partition Problems

WG '91 Proceedings of the 17th International Workshop
The mutual exclusion scheduling problem for permutation and comparability graphs

Information and Computation
On Equitable Coloring of d-Degenerate Graphs

SIAM Journal on Discrete Mathematics
Distance constrained labelings of graphs of bounded treewidth

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Monadic Second Order Logic on Graphs with Local Cardinality Constraints

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007)

ACM SIGACT News
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Decomposition, reformulation, and diving in university course timetabling

Computers and Operations Research
On the complexity of some colorful problems parameterized by treewidth

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Monadic second order logic on graphs with local cardinality constraints

ACM Transactions on Computational Logic (TOCL)
On the complexity of some colorful problems parameterized by treewidth

Information and Computation
Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proper coloring of a graph G is equitable if the sizes of any two color classes differ by at most one. A proper coloring is l-bounded, when each color class has size at most l. We consider the problems to determine for a given graph G (and a given integer l) whether G has an equitable (l-bounded) k-coloring. We prove that both problems can be solved in polynomial time on graphs of bounded treewidth, and show that a precolored version remains NP-complete on trees.