arXiv (All)
open access
Cubic vertices in minimal braces
Braces play a fundamental role in matching theory, as they, together with bricks, constitute the basic building blocks of matching covered graphs in the tight cut decomposition. A brace is minimal if deleting any edge from it results in a graph that is not a brace. We prove that every perfect matchi
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
- Perfect matching covers of claw-free cubic graphs#1156072
- Bricks in which every vertex is incident with a forcing edge#793750
- Bricks in which every vertex is incident with a forcing edge#789745
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor#1105043
Record · ID 1216015
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