Eulerian Walks in Graphs

DOI10.1137/0202003zbMATH Open0243.05115OpenAlexW1980100506MaRDI QIDQ5654071FDOQ5654071

Authors: S. Goodman, Stephen T. Hedetniemi 

Publication date: 1973

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0202003

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (2)

• A graph approximation heuristic for the vertex cover problem on planar graphs
• Gallai theorems for graphs, hypergraphs, and set systems

This page was built for publication: Eulerian Walks in Graphs

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