Hamilton cycles in directed Euler tour graphs
type: Item
instance of: scholarly article
title: Hamilton cycles in directed Euler tour graphs
zbMATH Open document ID: 0632.05038
DOI: 10.1016/0012-365X(87)90198-1
author: Xiaofeng Guo
author: Fuji Zhang
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: The directed Euler tour graph of a directed Eulerian multigraph without loops D, denoted by Eu(D), is an undirected simple graph defined as follows: The vertices of Eu(D) are directed Euler tours of D, and two directed Euler tours E and F are adjacent in Eu(D) if they can be obtained from each other by a T-transformation which is defined in the paper. The authors prove that if D is a directed Euler graph having at least three directed Euler tours then any edge of Eu(D) is contained in a Hamilton cycle of Eu(D).
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4027509
zbMATH Keywords: directed Euler tour graph
zbMATH Keywords: T-transformation
zbMATH Keywords: Hamilton cycle
reviewed by: Ioan Tomescu
MaRDI profile type: Publication
cites work: Hamilton cycles in Euler tour graphs
cites work: Q5422499
cites work: Q3315533
description: scientific article; zbMATH DE number 4027509