The graphs for which all strong orientations are hamiltonian

DOI10.1002/jgt.3190030304zbMath0442.05032OpenAlexW2068002574WikidataQ89046138 ScholiaQ89046138MaRDI QIDQ3884132

Martin Grötschel, Frank Harary

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030304

zbMATH Keywords

directed graphstrongly oriented Hamiltonian graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Cycles in bipartite tournaments ⋮ Unnamed Item

Cites Work

• Unnamed Item

This page was built for publication: The graphs for which all strong orientations are hamiltonian