On the Structure of the Strong Orientations of a Graph
From MaRDI portal
Publication:5285935
DOI10.1137/0406003zbMATH Open0781.05024OpenAlexW2046763872MaRDI QIDQ5285935FDOQ5285935
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
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
- On the semi-proper orientations of graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cited In (6)
- Weakly transitive orientations, Hasse diagrams and string graphs
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
- On reversal of graph orientation
- 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
- A note on a question of C. D. Savage
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)