Characterizing minimally 1-factorable \(r\)-regular bipartite graphs (Q1598818): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Domenico Labbate / rank | |||
| Property / author | |||
| Property / author: Domenico Labbate / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing minimally 1-factorable \(r\)-regular bipartite graphs |
scientific article |
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
