Orthogonal matchings (Q5917417)
From MaRDI portal
scientific article; zbMATH DE number 1838950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Orthogonal matchings |
scientific article; zbMATH DE number 1838950 |
Statements
Orthogonal matchings (English)
0 references
2 December 2002
0 references
Let \(G\) be a graph decomposed into \(m\) 2-factors. An orthogonal matching in \(G\) is a matching which contains exactly one edge from each 2-factor. It is proved that \(G\) has an orthogonal matching if the order of \(G\) is at least \(3m- 2\).
0 references
orthogonal matching
0 references
2-factor
0 references
