Searching for a strong double tracing in a graph
From MaRDI portal
Publication:1265251
DOI10.1007/BF02564801zbMath0907.90267OpenAlexW1990323900MaRDI QIDQ1265251
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
Programming involving graphs or networks (90C35) Combinatorics in computer science (68R05) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- An augmenting path algorithm for linear matroid parity
- How to determine the maximum genus of a graph
- A problem regarding the tracing of graphs
- Doubly eulerian trails on rectangular grids
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- The Directed Rural Postman Problem with Turn Penalties
- On Traversing Graphs
This page was built for publication: Searching for a strong double tracing in a graph
