Induced subgraphs and path decompositions

DOI10.37236/11364zbMath1516.05146arXiv2206.15054OpenAlexW4379232451MaRDI QIDQ6162145

Robert Hickingbotham

Publication date: 15 June 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.15054

zbMATH Keywords

pathwidthsparse graphsbounded maximum degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76) Density (toughness, etc.) (05C42)

Related Items (1)

Treewidth, Circle Graphs, and Circular Drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. I. Excluding a forest
• Graph minors. V. Excluding a planar graph
• Quickly excluding a forest
• A partial k-arboretum of graphs with bounded treewidth
• On the tree-width of even-hole-free graphs
• Tree-width dichotomy
• Deciding atomicity of subword-closed languages
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
• Grid induced minor theorem for graphs of small degree
• Graph Theory
• Parameters Tied to Treewidth
• Radius two trees specify χ‐bounded classes
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Degree-3 Treewidth Sparsifiers
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
• (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth

This page was built for publication: Induced subgraphs and path decompositions