Searching for a strong double tracing in a graph

DOI10.1007/BF02564801MaRDI QIDQ1265251zbMATH OpenOpenAlexFDO

Authors Enrique Benavent López, David Soler Fernández

Publication date 28 September 1998

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02564801

zbMATH Keywords

\(U\)-turnconnected graphEulerian graphstrong double tracing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Bidirectional retracting-free double tracings and upper embeddability of graphs
• Oriented walk double covering and bidirectional double tracing
• scientific article; zbMATH DE number 1218021
• An algorithm for an Eulerian trail traversing specified edges in given order

Cites work

• A problem regarding the tracing of graphs
• An augmenting path algorithm for linear matroid parity
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Bidirectional retracting-free double tracings and upper embeddability of graphs
• Doubly eulerian trails on rectangular grids
• How to determine the maximum genus of a graph
• On Traversing Graphs
• The Directed Rural Postman Problem with Turn Penalties

Cited in

(3)

• How to survive while visiting a graph
• Deriving graphs with a retracting-free bidirectional double tracing
• The Rural Postman Problem on mixed graphs with turn penalties

This page was built for publication: Searching for a strong double tracing in a graph

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