Finding Skew Partitions Efficiently
暂无分享,去创建一个
Yoshiharu Kohayakawa | Celina M. H. de Figueiredo | Sulamita Klein | Bruce A. Reed | B. Reed | Y. Kohayakawa | S. Klein | C. M. Figueiredo
[1] Pavol Hell,et al. List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.
[2] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[3] P. Hell,et al. Computational complexity of graph compaction , 1997 .
[4] Pavol Hell,et al. List Homomorphisms and Circular Arc Graphs , 1999, Comb..
[5] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[6] Vasek Chvátal,et al. Recognizing decomposable graphs , 1984, J. Graph Theory.
[7] Vasek Chvátal,et al. Star-cutsets and perfect graphs , 1985, J. Comb. Theory, Ser. B.
[8] Yoshiharu Kohayakawa,et al. Finding Skew Partitions Efficiently , 2000, J. Algorithms.
[9] Michael Stiebitz,et al. A solution to a colouring problem of P. Erdös , 1992, Discret. Math..
[10] Sulamita Klein,et al. Complexity of graph partition problems , 1999, STOC '99.
[11] Bruce A. Reed,et al. Complete Multi-partite Cutsets in Minimal Imperfect Graphs , 1993, J. Comb. Theory, Ser. B.
[12] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[13] Hazel Everett,et al. An Optimal Algorithm for Finding Clique-Cross Partitions , 1998 .
[14] Min-Li Yu,et al. Generalized Partitions of Graphs , 1999, Discret. Appl. Math..