Simplicity in Eulerian circuits: uniqueness and safety

DOI10.1016/j.ipl.2023.106421zbMath1529.05148arXiv2208.08522OpenAlexW4380786948MaRDI QIDQ6072204

Alexandru I. Tomescu, Nidia Obscura Acosta

Publication date: 12 October 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.08522

zbMATH Keywords

safetygraph algorithmsBEST theoremcut nodeEulerian circuit

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulerian graphs and related topics. Part 1, Volume 1
• Persistency in maximum cardinality bipartite matchings
• Safety and completeness in flow decompositions for RNA assembly
• Safe and Complete Contig Assembly Via Omnitigs
• An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
• On Unicursal Paths in a Network of Degree 4

This page was built for publication: Simplicity in Eulerian circuits: uniqueness and safety