On the Structure of the Strong Orientations of a Graph

DOI10.1137/0406003MaRDI QIDQ5285935zbMATHOpenAlexFDO

Authors

Publication date 29 June 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

orientationdirected pathsdirected cycles

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• Graphs with many strong orientations
• Strongly 2-connected orientations of graphs
• Strongly connected orientations of plane graphs
• On the orientation of graphs and hypergraphs
• scientific article; zbMATH DE number 1439402
• On strong distances in oriented graphs
• Strongly connected orientations of mixed multigraphs
• Strong orientations of planar graphs with bounded stretch factor
• scientific article; zbMATH DE number 5115622
• On the semi-proper orientations of graphs

Cited in

(6)

• A note on a question of C. D. Savage
• Interpolation theorem for a continuous function on orientations of a simple graph
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• Weakly transitive orientations, Hasse diagrams and string graphs
• On reversal of graph orientation
• Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents

This page was built for publication: On the Structure of the Strong Orientations of a Graph

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