A characterisation of graphs having three pariwise compatible Euler tours (Q1264154)
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 4128846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterisation of graphs having three pariwise compatible Euler tours |
scientific article; zbMATH DE number 4128846 |
Statements
A characterisation of graphs having three pariwise compatible Euler tours (English)
0 references
1991
0 references
Two Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutive in both tours. We obtain a good characterization for the graphs which contain three pairwise compatible Euler tours. As a corollary we deduce that the line graph of a 3-connected, 4-regular simple graph is decomposable into three edge-disjoint Hamilton circuits.
0 references
isotropic systems
0 references
Euler tours
0 references
line graph
0 references
edge-disjoint Hamilton circuits
0 references
0 references
0.8753981590270996
0 references
0.8148220181465149
0 references
0.8036350607872009
0 references
0.7984992861747742
0 references
