Unilateral orientation of mixed graphs

DOI10.1007/978-3-642-11266-9_49MaRDI QIDQ3401117zbMATH OpenOpenAlexFDO

Authors Tamara Mchedlidze, Antonios Symvonis

Publication date 28 January 2010

Published in SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11266-9_49

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the forced unilateral orientation number of a graph
• Orientations with single source and sink
• Algorithms and Computation
• Path-driven orientation of mixed graphs
• A note on orientations of mixed graphs

Cited in

(9)

• An algorithm for fraternal orientation of graphs
• On the forced unilateral orientation number of a graph
• Unmixedness of some weighted oriented graphs
• Upward and quasi-upward planarity testing of embedded mixed graphs
• Upward book embeddings of st-graphs
• A note on orientations of mixed graphs
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• Uni-directional alternating group graphs
• On computing large temporal (unilateral) connected components

This page was built for publication: Unilateral orientation of mixed graphs

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