论文信息 - The toughness of split graphs

The toughness of split graphs

In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).

Gerhard J. Woeginger

[1] S. Louis Hakimi,et al. Recognizing tough graphs is NP-hard , 1990, Discret. Appl. Math..

[2] Dieter Kratsch,et al. Toughness, hamiltonicity and split graphs , 1996, Discret. Math..

[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[4] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[5] William H. Cunningham. On submodular function minimization , 1985, Comb..

[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .