Precoloring extension on unit interval graphs
- 15 April 2006
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 154 (6), 995-1002
- https://doi.org/10.1016/j.dam.2005.10.008
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Eulerian disjoint paths problem in grid graphs is NP-completeDiscrete Applied Mathematics, 2004
- A short proof that ‘proper = unit’Discrete Mathematics, 1999
- Precoloring Extension III: Classes of Perfect GraphsCombinatorics, Probability and Computing, 1996
- NP-completeness of some edge-disjoint paths problemsDiscrete Applied Mathematics, 1995
- On the complexity of the disjoint paths problemCombinatorica, 1993
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992
- An O(qn) algorithm to q-color a proper family of circular arcsDiscrete Mathematics, 1985
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc GraphsSIAM Journal on Algebraic Discrete Methods, 1981