Title resolution pending

· 1967

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

representative citing papers

Extremal minimal bipartite matching covered graphs

math.CO · 2024-04-09 · unverdicted · novelty 6.0

Extremal minimal bipartite matching covered graphs are exactly the graphs obtained by pairing leaves of two trees without degree-2 vertices.

citing papers explorer

Showing 1 of 1 citing paper.

Extremal minimal bipartite matching covered graphs math.CO · 2024-04-09 · unverdicted · none · ref 3
Extremal minimal bipartite matching covered graphs are exactly the graphs obtained by pairing leaves of two trees without degree-2 vertices.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer