The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph

DOI10.18255/1818-1015-2023-3-264-282zbMath1527.05109OpenAlexW4387423286MaRDI QIDQ6062749

Aleksandr Valer'Evich Smirnov

Publication date: 2 December 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais804

zbMATH Keywords

Eulerian cycleEulerian trailreachability setdivisible graphmultiple graphmultiple pathcovering trailsgraph with quasi-vertices

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Metagraphs and their applications.
• An algorithm for an Eulerian trail traversing specified edges in given order
• Spanning tree of a multiple graph
• Transformations of Euler Tours
• An eulerian trail traversing specified edges in given order
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph