arXiv (All)
open access
Universality in the algebra and topology of cographs
A finite simple graph $G$ is called a cograph if it does not contain the path on four vertices $P_4$ as an induced subgraph. It is classically known that the family of cographs are well-quasi-ordered by the induced subgraph relation \cite{D}. In preceding work of Knudsen and the third author \cite[T
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
- Can Kuhn’s Taxonomic Incommensurability Be an Image of Science?#758992
- There is no $8$-regular $K_3$-irregular graph#1142280
- Counting Near-Spanning Matchings in Latin Squares and Steiner Triple Systems#998575
- Quasisymmetric Schubert calculus#792585
- Quasisymmetric Schubert calculus#788585
Record · ID 927832
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