arXiv (All)
open access
Matching Complexes of Outerplanar Graphs
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are con
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
- Solvability of Approximate Agreement on Graphs and Simplicial Complexes#303176
- Hardness and Approximation Algorithms for Balanced Districting Problems#1011993
- Computing the minimal perimeter polygon for digital objects in the triangular tiling#1083616
- Combinatorial and graph-theoretic properties of the (1,1)-octagonal tilings#332321
- Large-Scale Autonomous Discovery of Kissing Number Constructions#1129653
Record · ID 1063729
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