On the structure of minimally \(n\)-extendable bipartite graphs (Q1301712): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4304325 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3360201 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4304323 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3800093 / rank | |||
Normal rank | |||
Latest revision as of 21:28, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the structure of minimally \(n\)-extendable bipartite graphs |
scientific article |
Statements
On the structure of minimally \(n\)-extendable bipartite graphs (English)
0 references
23 February 2000
0 references
perfect matching
0 references
minimally \(n\)-extendable bipartite graph
0 references
