Eulerian Cover with Ordered Enclosing for Flat Graphs

DOI10.1016/j.endm.2007.01.004zbMath1293.05182OpenAlexW1980182810MaRDI QIDQ3439561

Tatiana Panyukova

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.004

zbMATH Keywords

pathsalgorithmscycleschainsEulerian graphstracing

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Mathematical models and routing algorithms for CAD technological preparation of cutting processes ⋮ The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours

Cites Work

• Unnamed Item

This page was built for publication: Eulerian Cover with Ordered Enclosing for Flat Graphs