Bipartite graphs with a perfect matching and digraphs (Q3392504)
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: Bipartite graphs with a perfect matching and digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite graphs with a perfect matching and digraphs |
scientific article |
Statements
17 August 2009
0 references
\(k\)-extendable
0 references
bipartite graphs
0 references
strongly \(k\)-connected
0 references
digraphs
0 references
strong component
0 references
elementary component
0 references
indecomposable
0 references
irreducible
0 references
perfect matching
0 references
math.CO
0 references
0.8116809129714966
0 references
