Two-factorizations of small complete graphs (Q1569867): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:18, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two-factorizations of small complete graphs |
scientific article |
Statements
Two-factorizations of small complete graphs (English)
0 references
9 July 2000
0 references
A 2-factor is a spanning 2-regular subgraph and a 2-factorization is a partition of the edge set into 2-factors. The type of a 2-factor of an \(n\)-vertex graph \(G\) is a partition of \(n\) into parts no less than 3. The type of a 2-factorization is a list of the types of the 2-factors in it, presented in nondecreasing order, assuming an order on the types of the 2-factors. This paper enumerates all 2-factorizations classified by type for the complete graph on nine vertices, and for 2-factorizations of selected types of the complete graph on 11 vertices.
0 references
two-factor
0 references
two-factorization
0 references