A 1-factorization of the iterated line graphs of regular graphs (Q1801745)
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: A 1-factorization of the iterated line graphs of regular graphs |
scientific article; zbMATH DE number 205794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 1-factorization of the iterated line graphs of regular graphs |
scientific article; zbMATH DE number 205794 |
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
0.8043595552444458
0 references
0.7986814379692078
0 references
