The complexity of chromatic strength and chromatic edge strength

Computational Complexity

Volumn 14, Issue 4, 2006, Pages 308-340

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Chromatic index; Chromatic number; Chromatic strength; Graph coloring

Indexed keywords

EID: 33644879991     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-005-0201-2     Document Type: Article

References (39)

1. A. BAR-NOY, M. BELLARE, M. M. HALLDÓRSSON, H. SHACHNAI & T. TAMIR (1998). On chromatic sums and distributed resource allocation. Inform, and Comput. 140, 183-202.
2. A. BAR-NOY & G. KORTSARZ (1998). Minimum color sum of bipartite graphs. J. Algorithms 28, 339-365.
3. M. BIRÓ, M. HUJTER & ZS. TUZA (1992). Precoloring extension. I. Interval graphs. Discrete Math. 100, 267-279.
4. H. L. BODLAENDER, K. JANSEN & G. J. WOEGINGER (1994). Scheduling with incompatible jobs. Discrete Appl. Math. 55, 219-232.
5. M. R. GAREY & D. S. JOHNSON (1979). Computers and Intractability. W. H. Freeman and Co., San Francisco, CA.
6. M. R. GAREY, D. S. JOHNSON & L. STOCKMEYER (1976). Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237-267.
7. K. GIARO, R. JANCZEWSKI, M. KUBALE & M. MAŁAFIEJSKI (2002). A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. In Approximation Algorithms for Combinatorial Optimization 2002, Lecture Notes in Comput. Sci. 2462, Springer, Berlin, 135-145.
8. K. GIARO & M. KUBALE (2000). Edge-chromatic sum of trees and bounded cyclicity graphs. Inform. Process. Lett. 75, 65-69.
9. H. HAJIABOLHASSAN, M. L. MEHRABADI & R. TUSSERKANI (2000). Minimal coloring and strength of graphs. Discrete Math. 215, 265-270.
10. M. M. HALLDÖRSSON, G. KORTSARZ & H. SHACHNAI (2003). Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37, 187-209.
11. L. A. HEMACHANDRA (1989). The strong exponential hierarchy collapses. J. Comput. System Sci. 39, 299-322.
12. E. HEMASPAANDRA, L. A. HEMASPAANDRA & J. ROTHE (1997). Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM 44, 806-825.
13. E. HEMASPAANDRA & J. ROTHE (1998). Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. Inform. Process. Lett. 65, 151-156.
14. I. HOLYER (1981). The NP-completeness of edge-coloring. SIAM J. Comput. 10, 718-720.
15. M. HOLZER & P. MCKENZIE (2002). On auxiliary pushdown and stack automata. ACM SIGACT News 33, 32-45.
16. M. HOLZER & P. MCKENZIE (2003). Alternating and empty alternating auxiliary stack automata. Theoret. Comput. Sci. 299, 307-326.
17. M. HUJTER & Zs. TUZA (1993). Precoloring extension. II. Graph classes related to bipartite graphs. Acta Math. Univ. Comen. 62, 1-11.
18. H. IZBICKI (1964). An edge colouring problem. In Theory of Graphs and its Applications (Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., Prague, 53-61.
19. NP[O(log n)] and sparse Turing-complete sets for NP. J. Comput. System Sci. 39, 282-298.
20. E. KUBICKA (1989). The chromatic sum of a graph. Ph.D. thesis, Western Michigan Univ.
21. E. KUBICKA & A. J. SCHWENK (1989). An introduction to chromatic sums. In Proc. ACM Computer Science Conf., Springer, Berlin, 15-21.
22. K.-J. LANGE & K. REINHARDT (1994). Empty alternation. In Mathematical Foundations of Computer Science 1994 (Košice), Springer, Berlin, 494-503.
23. D. LEVEN & Z. GALIL (1983). NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4, 35-44.
24. L. LOVÁSZ (1997). The membership problem in jump systems. J. Combin. Theory Ser. B 70, 45-66.
25. S. R. MAHANEY (1982). Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. J. Comput. System Sci. 25, 130-143.
26. D. MARX (2004). Precoloring extension on chordal graphs. Manuscript. Preliminary version presented at Graph Theory 2004, Paris.
27. D. MARX (2005). A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett. 33, 382-384.
28. B. MCKAY (1990). Nauty user's guide, version 1.5. Technical Report TR-CS-90-02, Computer Science Department, Australian National University. Also http://cs.anu.edu.au/people/bdm/nauty/.
29. J. MITCHEM, P. MORRISS & E. SCHMEICHEL (1997). On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 17, 229-241.
30. S. NICOLOSO, M. SARRAFZADEH & X. SONG (1999). On the sum coloring problem on interval graphs. Algorithmica 23, 109-126.
31. C. H. PAPADIMITRIOU & S. ZACHOS (1982). Two remarks on the power of counting. In Proc. 6th GI-Conference on Theoretical Computer Science, Springer, 269-276.
32. M. R. SALAVATIPOUR (2003). On sum coloring of graphs. Discrete Appl. Math. 127, 477-488.
33. p-completeness: a classical approach for new results. In FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (New Delhi), Lecture Notes in Comput. Sci. 1974, Springer, Berlin, 348-360.
34. K. J. SUPOWIT (1987). Finding a maximum planar subset of nets in a channel. IEEE Trans. Comput. Aided Design 6, 93-94.
35. T. SZKALICZKI (1999). Routing with minimum, wire length in the dogleg-free Manhattan model is NP-complete. SIAM J. Comput. 29, 274-287.
36. Zs. TUZA (1997). Graph colorings with local constraints - a survey. Discuss. Math. Graph Theory 17, 161-228.
37. K. W. WAGNER (1987). More complicated questions about maxima and minima, and some closures of NP. Theoret. Comput. Sci. 51, 53-80.
38. K. W. WAGNER (1990). Bounded query classes. SIAM J. Comput. 19, 833-846.
39. D. WEST (1994-95). Open problems section. The SIAM Activity Group on Discrete Mathematics Newsletter 5, no. 2, 9.