A 1-factorization of the iterated line graphs of regular graphs (Q1801745): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 1-factorization of the iterated line graphs of regular graphs |
scientific article |
Statements
A 1-factorization of the iterated line graphs of regular graphs (English)
0 references
17 August 1993
0 references
The author shows that the \(k\)-th iterated line graph \((k\geq 1)\) of a 1- factorizable graph is 1-factorizable iff it has an even number of vertices (which occurs if \(k\geq 2)\).
0 references
1-factorization
0 references
regular graphs
0 references
coloring
0 references
line graph
0 references
