Sufficient Conditions for Polynomial-Time Detection of Induced Minors
- 7 February 2025
- book chapter
- Published by Springer Nature
- p. 195-208
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Detecting $K_{2,3}$ as an Induced Minor2024
- Induced paths in graphs without anticomplete cyclesJournal of Combinatorial Theory, Series B, 2023
- Grid induced minor theorem for graphs of small degreeJournal of Combinatorial Theory, Series B, 2023
- Induced minors and well-quasi-orderingJournal of Combinatorial Theory, Series B, 2019
- Induced Minor Free Graphs: Isomorphism and Clique-WidthAlgorithmica, 2016
- On graph contractions and induced minorsDiscrete Applied Mathematics, 2012
- The disjoint paths problem in quadratic timeJournal of Combinatorial Theory, Series B, 2012
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint PathsLecture Notes in Computer Science, 2011
- The complexity of induced minors and related problemsAlgorithmica, 1995
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995