scientific article; zbMATH DE number 6007896

MaRDI QIDQ3115259zbMATH OpenFDO

Authors T. A. Panyukova

Publication date 20 February 2012

zbMATH Keywords

coveringplane graphpathtrailordered enclosing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Eulerian Cover with Ordered Enclosing for Flat Graphs
• Optimal enclosing regions in planar graphs
• scientific article; zbMATH DE number 4110709
• Covers of Eulerian graphs
• On optimal beyond-planar graphs
• By-passes with ordered enclosing in planar graphs
• Algorithmic aspects of regular graph covers with applications to planar graphs
• scientific article; zbMATH DE number 20622
• COVERING GRAPHS WITH OPTIMAL COLLECTION OF EDGES
• Optimal algorithms for solving problems of arrangement and covering of plane polygonal figures

Cited in

(7)

• On the number of \(OE\)-trails for a fixed transition system
• By-passes with ordered enclosing in planar graphs
• Mathematical models and routing algorithms for CAD technological preparation of cutting processes
• Optimal enclosing regions in planar graphs
• Chain sequences with ordered enclosing
• The paths with local restrictions
• An algorithm for an Eulerian trail traversing specified edges in given order

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115259)