Detecting K₂,3 as an induced minor

DOI10.1007/978-3-031-63021-7_12MaRDI QIDQ7021100zbMATH OpenFDO

Authors Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_12

zbMATH Keywords

induced minorminimal separatorTruemper configurations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A characterization of perfect graphs
• Algorithms for Perfectly Contractile Graphs
• Approximation algorithms for intersection graphs
• Bisimplicial separators
• Detecting wheels
• Excluding induced subdivisions of the bull and related graphs
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition
• Normal hypergraphs and the perfect graph conjecture
• Partial characterizations of 1-perfectly orientable graphs
• Recognizing Berge graphs
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• The (theta, wheel)-free graphs. II: Structure theorem
• The Complexity of Coloring Circular Arcs and Chords
• The complexity of induced minors and related problems
• The three-in-a-tree problem
• Three-in-a-tree in near linear time
• Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure

Cited in

(3)

• Induced minor models. I: Structural properties and algorithmic consequences
• Unavoidable induced subgraphs in graphs with complete bipartite induced minors
• Induced disjoint paths without an induced minor

This page was built for publication: Detecting \(K_{2,3}\) as an induced minor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021100)