Edge Contractions in Subclasses of Chordal Graphs
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 528-539
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Contractions of Planar Graphs in Polynomial Time2010
- Induced Subgraph Isomorphism on Interval and Proper Interval GraphsLecture Notes in Computer Science, 2010
- The computational complexity of graph contractions II: Two tough polynomially solvable casesNetworks, 2008
- The computational complexity of graph contractions I: Polynomially solvable and NP‐complete casesNetworks, 2007
- Graph Classes: A Survey1999
- Quasi-threshold graphsDiscrete Applied Mathematics, 1996
- On the complexity of finding iso- and other morphisms for partial k-treesDiscrete Mathematics, 1992
- Induced subraph isomorphism for cographs is NP-completeLecture Notes in Computer Science, 1991
- Contractibility and NP‐completenessJournal of Graph Theory, 1987
- The comparability graph of a treeProceedings of the American Mathematical Society, 1962