Precoloring extension on unit interval graphs

Discrete Applied Mathematics

Volumn 154, Issue 6, 2006, Pages 995-1002

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

NP completeness; Precoloring extension; Unit interval graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY;

NP COMPLETENESS; PRECOLORING EXTENSION; UNIT INTERVAL GRAPHS;

GRAPH THEORY;

EID: 33644782773     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.10.008     Document Type: Article

References (14)

1. M. Biró, M. Hujter, and Zs. Tuza Precoloring extension. I. Interval graphs Discrete Math. 100 1-3 1992 267 279
2. M. Biró, M. Hujter, Zs. Tuza, Cross fertilisation of graph theory and aircraft maintenance scheduling, in: G. Davidson (Ed.), Thirty/Second Annual Symposium, AGIFORS (Airline Group of the International Federation of Operation Research Societies), 1993, pp. 307-317.
3. K.P. Bogart, and D.B. West A short proof that " proper = unit " Discrete Math. 201 1-3 1999 21 23
4. A. Frank Packing paths, circuits, and cuts - a survey Paths, Flows, and VLSI-layout (Bonn, 1988) 1990 Springer Berlin 47 100
5. M. Hujter, and Zs. Tuza Precoloring extension. II. Graph classes related to bipartite graphs Acta Math. Univ. Comenian. 62 1 1993 1 11
6. M. Hujter, and Zs. Tuza Precoloring extension. III. Classes of perfect graphs Combin. Probab. Comput. 5 1 1996 35 56
7. D. Marx Eulerian disjoint paths problem in grid graphs is NP-complete Discrete Appl. Math. 143 1-3 2004 336 341
8. M. Middendorf, and F. Pfeiffer On the complexity of the disjoint paths problem Combinatorica 13 1 1993 97 107
9. 2) algorithm for coloring proper circular arc graphs SIAM J. Algebraic Discrete Methods 2 2 1981 88 93
10. A. Recski Minimax results and polynomial algorithms in VLSI routing Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice 1990) 1992 North-Holland Amsterdam 261 273
11. F.S. Roberts Indifference graphs Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968) 1969 Academic Press New York 139 146
12. A. Teng, and A. Tucker An O(qn) algorithm to q-color a proper family of circular arcs Discrete Math. 55 2 1985 233 243
13. J. Vygen, Disjoint paths, Technical Report 94816, Research Institute for Discrete Mathematics, University of Bonn, 1994.
14. J. Vygen NP-completeness of some edge-disjoint paths problems Discrete Appl. Math. 61 1 1995 83 90