Disconnected cuts in claw-free graphs
- 1 November 2020
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 113, 60-75
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Leverhulme Trust (RPG-2016-258)
This publication has 26 references indexed in Scilit:
- Parameterizing cut sets in a graph by the number of their componentsTheoretical Computer Science, 2011
- On disconnected cuts and separatorsDiscrete Applied Mathematics, 2011
- vertex-set partition into nonempty partsDiscrete Mathematics, 2010
- Covering graphs with few complete bipartite subgraphsTheoretical Computer Science, 2009
- Bounding χ in terms of ω and Δ for quasi‐line graphsJournal of Graph Theory, 2008
- FindingH-partitions efficientlyRAIRO - Theoretical Informatics and Applications, 2005
- Linear-Time Recognition of Circular-Arc GraphsAlgorithmica, 2003
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applicationsAlgorithmica, 1995
- Paw-free graphsInformation Processing Letters, 1988
- Contractibility and NP‐completenessJournal of Graph Theory, 1987