arXiv (All)
open access
A chain theorem for planar PM-compact bricks
A connected graph $G$ is matching covered if it contains at least one edge and every edge belongs to some perfect matching of $G$. A matching covered graph is a brick if it is 3-connected and after removing any two vertices, the resulting graph has a perfect matching. Bricks are the building blocks
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
- The maximum size of simple solid matching covered graphs#1217108
- The maximum number of edges in minimal matching covered graphs#1105537
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
- Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948#997620
- Minimum Sum Vertex Cover via Minimum Vertex Cover#1063328
Record · ID 1326784
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