Equitable colorings of bounded treewidth graphs

Theoretical Computer Science

Volumn 349, Issue 1, 2005, Pages 22-30

  Bodlaender, Hans L ^a   Fomin, Fedor V ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Equitable coloring; Treewidth

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

EQUITABLE COLORING; TREEWIDTH;

GRAPH THEORY;

EID: 27844501135     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.027     Document Type: Conference Paper

References (28)

1. N. Alon A note on the decomposition of graphs into isomorphic matchings Acta Math. Hungar. 42 1983 221 223
2. B.S. Baker, and E.G. Coffman Jr. Mutual exclusion scheduling Theoret. Comput. Sci. 162 1996 225 243
3. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz Scheduling Computer and Manufacturing Processes second ed. 2001 Springer Berlin
4. H.L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 25 1996 1305 1317
5. H.L. Bodlaender, and K. Jansen Restrictions of graph partition problems, I Theoret. Comput. Sci. 148 1995 93 109
6. H.L. Bodlaender, and T. Kloks Efficient and constructive algorithms for the pathwidth and treewidth of graphs J. Algorithms 21 1996 358 402
7. B. Bollobás, and R.K. Guy Equitable and proportional coloring of trees J. Combin. Theory Ser. B 34 1983 177 186
8. G.J. Chang, and D. Kuo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
9. B.-L. Chen, M.-T. Ko, K.-W. Lih, Equitable and m -bounded coloring of split graphs, in: Combinatorics and Computer Science, Lecture Notes in Computer Science, Vol. 1120, Springer, Berlin, 1996, pp. 1-5.
10. B.-L. Chen, and K.-W. Lih Equitable coloring of trees J. Combin. Theory Ser. B 61 1994 83 87
11. E. Cohen, and M. Tarsi NP-completeness of graph decomposition problems J. Complexity 7 1991 200 212
12. M.R. Garey, R.L. Graham, D.S. Johnson, and D.E. Knuth Complexity results for bandwidth minimization SIAM J. Appl. Math. 34 1978 477 495
13. M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-completeness 1979 W.H. Freeman and Co San Francisco, CA
14. A. Hajnal, and E. Szemerédi Proof of a conjecture of P. Erdos Combinatorial Theory and its Applications Vol. II 1970 North-Holland Amsterdam 601 623
15. P. Hansen, A. Hertz, and J. Kuplinsky Bounded vertex colorings of graphs Discrete Math. 111 1993 305 312
16. S. Irani, and V. Leung Scheduling with conflicts, and applications to traffic signal control Proc. Seventh Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA'96) New York 1996 ACM New York 85 94
17. K. Jansen The mutual exclusion scheduling problem for permutation and comparability graphs Inform. Comput. 180 2003 71 81
18. M. Jarvis, and B. Zhou Bounded vertex coloring of trees Discrete Math. 232 2001 145 151
19. D. Kaller, A. Gupta, T. Shermer, The χ t -coloring problem, in: Symp. on Theoretical Aspects of Computer Science (STACS'95), Lecture Notes in Computer Science, Vol. 900, Springer, Berlin, 1995, pp. 409-420.
20. F. Kitagawa, and H. Ikeda An existential problem of a weight-controlled subset and its application to school timetable construction Discrete Math. 72 1988 195 211
21. D. Kobler, and U. Rotics Edge dominating set and colorings on graphs with fixed clique-width Discrete Appl. Math. 126 2003 197 221
22. A.V. Kostochka, K. Nakprasit, S.V. Pemmaraju, On equitable coloring of d-generate graphs. SIAM J. Discrete Math. 19 (1) (2005) 83-95.
23. J. Krarup, and D. de Werra Chromatic optimisation: limitations, objectives, uses, references European J. Oper. Res. 11 1982 1 19
24. K.-W. Lih The equitable coloring of graphs Handbook of Combinatorial Optimization Vol. 3 1998 Kluwer Academic Publishers Boston, MA 543 566
25. Z. Lonc, On complexity of some chain and antichain partition problems, in: Graph-theoretic Concepts in Computer Science (WG'91), Lecture Notes in Computer Science, Vol. 570, Springer, Berlin, 1992, pp. 97-104.
26. B. Monien The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete SIAM J. Algebraic Discrete Methods 7 1986 505 512
27. B.F. Smith, P.E. Bjørstad, and W.D. Gropp Domain Decomposition. Parallel Multilevel Methods for Elliptic Partial Differential Equations 1996 Cambridge University Press Cambridge
28. J. Fiala, P.A. Golovach, J. Kratochvi'l, Distance constrained labelings of graphs of bounded treewidth, in: Automata, Languages and Programming (ICALP 2005), Lecture Notes in Computer Science, Vol. 3580, Berlin, 2005, pp. 360-372.