A lower bound for the connectivity of directed Euler tour transformation graphs

DOI10.1016/0012-365X(95)00313-LzbMath0874.05034WikidataQ127861490 ScholiaQ127861490MaRDI QIDQ1356528

Xue Liang Li

Publication date: 9 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivitylower bounddirected Euler tour graphEulerian multigraphdirected Euler tourtransformation graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonicity in (0-1)-polyhedra
• Hamilton cycles in Euler tour graphs
• Hamilton cycles in directed Euler tour graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian Orientations and Circulations

This page was built for publication: A lower bound for the connectivity of directed Euler tour transformation graphs