Characterizing minimally 1-factorable \(r\)-regular bipartite graphs (Q1598818)
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 1-factorable \(r\)-regular bipartite graphs |
scientific article; zbMATH DE number 1746254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing minimally 1-factorable \(r\)-regular bipartite graphs |
scientific article; zbMATH DE number 1746254 |
Statements
Characterizing minimally 1-factorable \(r\)-regular bipartite graphs (English)
0 references
28 May 2002
0 references
The author considers the problem of classifying \(r\)-regular bigraphs which are minimally 1-factorable. A graph is called minimally 1-factorable, if it has a 1-factorisation and every 1-factor lies in a unique 1-factorisation. Minimally 1-factorable cubic graphs of girth 4 are classified.
0 references
biprtite graph
0 references
1-factor
0 references
cubic graph
0 references
1-factorization
0 references
