A characterisation of graphs having three pariwise compatible Euler tours (Q1264154): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterisation of graphs having three pariwise compatible Euler tours |
scientific article |
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
