arXiv (All)
open access
The maximum size of simple solid matching covered graphs
A connected graph with at least two vertices is matching covered if each of its edges is contained in a perfect matching. A matching covered graph is solid if every separating cut in it is a tight cut. A matching covered graph which is free of nontrivial tight cuts is a brick if it is nonbipartite.
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
- A chain theorem for planar PM-compact bricks#1326784
- Minimum Sum Vertex Cover via Minimum Vertex Cover#1063328
- Partitioning perfect graphs into comparability graphs#1247244
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
- A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph#1036437
Record · ID 1217108
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