Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Jansen, Klaus
and
Öhring, Sabine
1997.
Approximation Algorithms for Time Constrained Scheduling.
Information and Computation,
Vol. 132,
Issue. 2,
p.
85.
Jansen, Klaus
1997.
Algorithms and Complexity.
Vol. 1203,
Issue. ,
p.
25.
Kratochvíl, Jan
and
Tuza, Zsolt
1998.
Graph-Theoretic Concepts in Computer Science.
Vol. 1517,
Issue. ,
p.
114.
Albertson, Michael O
1998.
You Can't Paint Yourself into a Corner.
Journal of Combinatorial Theory, Series B,
Vol. 73,
Issue. 2,
p.
189.
Kratochvíl, J.
Tuza, Zs.
and
Voigt, M.
1998.
Complexity of choosing subsets from color sets.
Discrete Mathematics,
Vol. 191,
Issue. 1-3,
p.
139.
Kratochvíl, Jan
and
Tuza, Zsolt
1999.
Rankings of Directed Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 12,
Issue. 3,
p.
374.
Le, Van Bang
1999.
A good characterization of cograph contractions.
Journal of Graph Theory,
Vol. 30,
Issue. 4,
p.
309.
Albertson, Michael O
and
Moore, Emily H
1999.
Extending Graph Colorings.
Journal of Combinatorial Theory, Series B,
Vol. 77,
Issue. 1,
p.
83.
Dohmen, Klaus
2000.
On the Number of Precolouring Extensions.
European Journal of Combinatorics,
Vol. 21,
Issue. 8,
p.
989.
Fiala, Jiři
Kratochvíl, Jan
and
Proskurowski, Andrzej
2001.
Theoretical Computer Science.
Vol. 2202,
Issue. ,
p.
285.
Zverovich, Igor Ed.
and
Zverovich, Inessa I.
2004.
Forbidden induced subgraph characterization of cograph contractions.
Journal of Graph Theory,
Vol. 46,
Issue. 3,
p.
217.
de Werra, Dominique
Demange, Mare
Escoffier, Bruno
Monnot, Jerome
and
Paschos, Vangelis Th.
2004.
Algorithms and Computation.
Vol. 3341,
Issue. ,
p.
896.
Marx, Dániel
2004.
Parameterized and Exact Computation.
Vol. 3162,
Issue. ,
p.
83.
Fiala, Jiří
Kratochvíl, Jan
and
Proskurowski, Andrzej
2005.
Systems of distant representatives.
Discrete Applied Mathematics,
Vol. 145,
Issue. 2,
p.
306.
Marx, Dániel
2005.
NP‐completeness of list coloring and precoloring extension on the edges of planar graphs.
Journal of Graph Theory,
Vol. 49,
Issue. 4,
p.
313.
Hougardy, Stefan
2006.
Classes of perfect graphs.
Discrete Mathematics,
Vol. 306,
Issue. 19-20,
p.
2529.
Marx, Dániel
2006.
Precoloring extension on unit interval graphs.
Discrete Applied Mathematics,
Vol. 154,
Issue. 6,
p.
995.
Hell, Pavol
2006.
Topics in Discrete Mathematics.
Vol. 26,
Issue. ,
p.
407.
Bonomo, Flavia
Durán, Guillermo
and
Marenco, Javier
2006.
Exploring the complexity boundary between coloring and list-coloring.
Electronic Notes in Discrete Mathematics,
Vol. 25,
Issue. ,
p.
41.
Marx, Dániel
2006.
Parameterized coloring problems on chordal graphs.
Theoretical Computer Science,
Vol. 351,
Issue. 3,
p.
407.