On the Computational Complexity of Vertex Integrity and Component Order Connectivity
- 4 February 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 76 (4) , 1181-1202
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council (267959)
- Bergens Forskningsstiftelse (BeHard)
This publication has 16 references indexed in Scilit:
- The clique-separator graph for chordal graphsDiscrete Applied Mathematics, 2009
- Equitable colorings of bounded treewidth graphsTheoretical Computer Science, 2005
- Complexity of k-SAT2003
- Parameterized Complexity1999
- Graph Classes: A Survey1999
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- A survey of integrityDiscrete Applied Mathematics, 1992
- Counting clique trees and computing perfect elimination schemes in parallelInformation Processing Letters, 1989
- Comparability graphs and intersection graphsDiscrete Mathematics, 1983
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976