Construction of 4-Regular Graphs (Q3322128)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3853114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of 4-Regular Graphs |
scientific article; zbMATH DE number 3853114 |
Statements
Construction of 4-Regular Graphs (English)
0 references
1983
0 references
construction of graphs
0 references
edge-partition
0 references
linear forests
0 references
0.7909637093544006
0 references
0.7740443348884583
0 references
0.7740129232406616
0 references
0.7664362788200378
0 references
0.7611250877380371
0 references
The authors show that the class of 4-regular, simple, connected graphs can be generated by two extensions from \(K_ 5\) and two graphs of orders 6 and 11 respectively, and by three extensions from \(K_ 5\). They then apply these constructions to give a proof of the existence of an edge- partition of a 4-regular graph in three linear forests. For the entire collection see [Zbl 0513.00004].
0 references