arXiv (All)
open access
On extending induced subgraphs
When characterizing graphs defined by forbidden induced subgraphs, it is often desirable to understand how a graph $G$ can be generated incrementally from a given induced subgraph $H$. In this paper, we study a number of problems within this framework. First, for several notions of connectivity, we
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
- Induced subgraphs and tree decompositions XIX. Thetas and forests#927134
- Induced packing treewidth II. Excluding a clique or a biclique#1036011
- Graph determination problem from knowledge of its subgraphs#1328087
- Matroids and isomorphism problems for Bestvina-Brady groups#1110708
- A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra#926349
Record · ID 1342812
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