On the Computational Complexity of Vertex Integrity and Component Order Connectivity
暂无分享,去创建一个
[1] Fedor V. Fomin,et al. Equitable colorings of bounded treewidth graphs , 2005, Theor. Comput. Sci..
[2] Wayne Goddard,et al. A Survey of Integrity , 1992, Discret. Appl. Math..
[3] Walid Ben-Ameur,et al. The k-Separator Problem , 2013, COCOON.
[4] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[5] Richard C. T. Lee,et al. Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..
[6] Gerhard J. Woeginger. The toughness of split graphs , 1998, Discret. Math..
[7] Dieter Kratsch,et al. Measuring the Vulnerability for Classes of Intersection Graphs , 1997, Discret. Appl. Math..
[8] Danyang Zhang,et al. The Weighted Integrity Problem is Polynomial for Interval Graphs , 2006, Ars Comb..
[9] Pim van 't Hof,et al. On the Computational Complexity of Vertex Integrity , 2014, ArXiv.
[10] Shenggui Zhang,et al. Vulnerability parameters of split graphs , 2008, Int. J. Comput. Math..