Premium
An eulerian trail traversing specified edges in given order
Author(s) -
Maocheng Cai,
Fleischner Herbert
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190190202
Subject(s) - eulerian path , combinatorics , mathematics , traverse , graph , orientation (vector space) , set (abstract data type) , order (exchange) , enhanced data rates for gsm evolution , discrete mathematics , geometry , lagrangian , mathematical analysis , computer science , artificial intelligence , geodesy , programming language , geography , finance , economics
The following results are proved in this paper. Let G be a 2 k ‐edge‐connected eulerian graph. (i) For every set { e 1 , e 2 , ⃛, e 2 k +1 } ⊆ E ( G ) there is an eulerian trail T of the form e 1 , e 2 , ⃛, e 2 k +1 , ⃛. (ii) For every set E * = { e 1 , e 2 , ⃛, e k } ⊆ E ( G ) there is an eulerian trail T = e 1 , ⃛, e 2 , ⃛, e k , ⃛ in which the elements of E * are traversed in accordance with a prescribed orientation. © 1995 John Wiley & Sons, Inc.