arXiv (All)
open access
The maximum number of edges in minimal matching covered graphs
A connected graph $G$ with at least two vertices is {\em matching covered} if each of its edges lies in a perfect matching. A matching covered graph is {\em minimal} if the removal of any edge results in a graph that is no longer matching covered. Lovász and Plummer [J. Combin. Theory, Ser. B 23 (19
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
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- B-coloring of $K_{2,t}$-free planar graphs#1070014
- Variance of random greedy independent sets in triangle-free graphs#1084744
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- On-line majority edge-colourings of graphs#1142275
Record · ID 1105537
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