Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets
From MaRDI portal
Publication:6635076
DOI10.1016/J.DISC.2024.114195MaRDI QIDQ6635076
Sepehr Hajebi, Tara Abrishami, Maria Chudnovsky, Sophie Spirkl
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- On graphs with no induced subdivision of \(K_4\)
- Safe separators for treewidth
- Graph minors. V. Excluding a planar graph
- Upper bounds to the clique width of graphs
- Approximating clique-width and branch-width
- Grid induced minor theorem for graphs of small degree
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Treewidth of the Line Graph of a Complete Graph
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree
- Induced subgraphs and tree decompositions V. one neighbor in a hole
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
This page was built for publication: Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635076)
