Maximum k-regular induced subgraphs
- 21 March 2007
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 14 (4) , 455-463
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Spectral results on regular graphs with -regular setsDiscrete Mathematics, 2007
- Convex Quadratic Programming Approach to the Maximum Matching ProblemJournal of Global Optimization, 2001
- An upper bound on the independence number of a graph computable in polynomial-timeOperations Research Letters, 1995
- Efficient edge domination problems in graphsInformation Processing Letters, 1993
- Induced matchingsDiscrete Applied Mathematics, 1989
- NP-completeness of some generalizations of the maximum matching problemInformation Processing Letters, 1982
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Reducibility among Combinatorial Problems1972