Decomposing 10-regular graphs into paths of length 5 (Q2158191)
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: Decomposing 10-regular graphs into paths of length 5 |
scientific article; zbMATH DE number 7562657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing 10-regular graphs into paths of length 5 |
scientific article; zbMATH DE number 7562657 |
Statements
Decomposing 10-regular graphs into paths of length 5 (English)
0 references
26 July 2022
0 references
It is proved that every 10-regular graph which does not contain any 4-cycles can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths. Such decomposition is called balanced.
0 references
10-regular graph
0 references
balanced decomposition
0 references
0.8586732745170593
0 references
0.8047831654548645
0 references
0.8023741245269775
0 references
