Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 110-119
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On graph contractions and induced minorsDiscrete Applied Mathematics, 2012
- Contracting a Chordal Graph to a Split Graph or a TreeLecture Notes in Computer Science, 2011
- Edge Contractions in Subclasses of Chordal GraphsLecture Notes in Computer Science, 2011
- The k-Disjoint Paths Problem on Chordal Graphs2010
- Contractions of Planar Graphs in Polynomial Time2010
- The complexity of induced minors and related problemsAlgorithmica, 1995
- An Introduction to Chordal Graphs and Clique Trees1993
- Contractibility and NP‐completenessJournal of Graph Theory, 1987
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961