arXiv (OAI Expanded)
open access
Near-bipartite bricks in which every b-invariant edge is a forcing edge
A connected graph is matching covered if it has at least one edge and every edge lies in some perfect matching.Lovász proved that every matching covered graph G can be uniquely decomposed into a list of bricks and braces up to multiple edges. Denote by b(G) the number of bricks in such a decompositi
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
- Bricks in which every vertex is incident with a forcing edge#793750
- Bricks in which every vertex is incident with a forcing edge#789745
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- Complementizers on edge#296694
Record · ID 1070862
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