scholarly journals Locally self-avoiding Eulerian tours

2017 ◽  
Vol 62 ◽  
pp. 27-32
Author(s):  
Tien-Nam Le
Keyword(s):  
Eulerian Tours

scholarly journals On the number of spanning trees and Eulerian tours in iterated line digraphs

1997 ◽  
Vol 73 (1) ◽  
pp. 59-67 ◽  
Author(s):  
Zhang Huaxiao ◽  
Zhang Fuji ◽  
Huang Qiongxiang
Keyword(s):  
Spanning Trees ◽  
Eulerian Tours ◽  
Number Of Spanning Trees

scholarly journals The Complexity of Counting Eulerian Tours in 4-regular Graphs

Algorithmica ◽  
2010 ◽  
Vol 63 (3) ◽  
pp. 588-601 ◽  
Author(s):  
Qi Ge ◽  
Daniel Štefankovič
Keyword(s):  
Regular Graphs ◽  
Eulerian Tours

scholarly journals Multi-Eulerian Tours of Directed Graphs

10.37236/5588 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Matthew Farrell ◽  
Lionel Levine
Keyword(s):  
Connected Graph ◽  
Directed Graphs ◽  
Minimal Length ◽  
Closed Path ◽  
Directed Edge ◽  
Simple Generalization ◽  
Strongly Connected ◽  
Eulerian Tours ◽  
Eulerian Tour

Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e)=tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is bounded in terms of the Pham index, a measure of 'Eulerianness'.

Sign in / Sign up

Export Citation Format

Share Document