Graphs for which all strong orientations are Eulerian

MaRDI QIDQ789400zbMATH OpenFDO

Authors Ortrud R. Oellermann, H. C. Swart

Publication date 1984

Published in Expositiones Mathematicae (Search for Journal in Brave)

zbMATH Keywords

Eulerian digraphsstrong orientations

Mathematics Subject Classification ID

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

Review text

The authors show that every strong orientation of a connected Eulerian graph G is Eulerian if and only if any two distinct cycles of G intersect in at most one vertex.

Recommendations

• Strong orientations without even directed circuits
• Two‐connected orientations of Eulerian graphs
• Strongly 2-connected orientations of graphs
• Eulerian Orientations and Circulations
• On Eulerian orientations of even-degree hypercubes

Cited in

(11)

• Cell rotation graphs of strongly connected orientations of plane graphs with an application
• Strong orientations without even directed circuits
• Partially broken orientations of Eulerian plane graphs
• On Eulerian orientations of even-degree hypercubes
• Eulerian Orientations and Circulations
• Strongly 2-connected orientations of graphs
• scientific article; zbMATH DE number 857648 (Why is no real title available?)
• Two‐connected orientations of Eulerian graphs
• Subeulerian oriented graphs
• Partially broken orientations of Eulerian graphs on closed surfaces
• Small length circuits in Eulerian orientations of graphs

This page was built for publication: Graphs for which all strong orientations are Eulerian

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