A decidability result for the dominating set problem
暂无分享,去创建一个
[1] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.
[2] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[3] Guoli Ding,et al. Subgraphs and well-quasi-ordering , 1992, J. Graph Theory.
[4] Peter Damaschke,et al. Domination in Convex and Chordal Bipartite Graphs , 1990, Inf. Process. Lett..
[5] Alan A. Bertossi,et al. Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..
[6] Vadim V. Lozin,et al. Coloring edges and vertices of graphs without short or long cycles , 2007, Contributions Discret. Math..
[7] Zsolt Tuza,et al. Complexity of Coloring Graphs without Forbidden Induced Subgraphs , 2001, WG.
[8] Vadim V. Lozin,et al. Boundary classes of graphs for the dominating set problem , 2004, Discrete Mathematics.
[9] Hong-Jian Lai,et al. Line Graphs and Forbidden Induced Subgraphs , 2001, J. Comb. Theory, Ser. B.
[10] Michael R. Fellows,et al. Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.
[11] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..
[12] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.
[13] Vadim V. Lozin,et al. NP-hard graph problems and boundary classes of graphs , 2007, Theor. Comput. Sci..
[14] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.
[15] Andreas Brandstädt,et al. The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs , 1987, Theor. Comput. Sci..
[16] Russell Merris,et al. Split graphs , 2003, Eur. J. Comb..
[17] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .