Characterizing minimally \(n\)-extendable bipartite graphs (Q2483409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizing minimally n-extendable bipartite graphs |
scientific article; zbMATH DE number 5268470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing minimally \(n\)-extendable bipartite graphs |
scientific article; zbMATH DE number 5268470 |
Statements
Characterizing minimally \(n\)-extendable bipartite graphs (English)
0 references
28 April 2008
0 references
\(n\)-extendable graph
0 references
minimally \(n\)-extendable graph
0 references
\(M\)-alternating path
0 references
bipartite graph
0 references
0.9678669
0 references
0.9436137
0 references
0.92630637
0 references
0.90884537
0 references
0.90537095
0 references
