arXiv (All)
open access
Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth
The pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unavoidable induced subgraphs of large and infinite $2$-edge-connected graphs#155548
- Induced packing treewidth II. Excluding a clique or a biclique#1036011
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth#677074
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
Record · ID 1051978
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive