The orientation number of two complete graphs with linkages
From MaRDI portal
(Redirected from Publication:556840)
Recommendations
Cites work
- scientific article; zbMATH DE number 4204370 (Why is no real title available?)
- scientific article; zbMATH DE number 3991530 (Why is no real title available?)
- scientific article; zbMATH DE number 3991541 (Why is no real title available?)
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Diameter-preserving orientations of the torus
- Diametrically critical tournaments
- Every vertex a king
- Minimizing and maximizing the diameter in orientations of graphs
- On a conjecture concerning optimal orientations of the Cartesian product of a triangle and an odd cycle
- On optimal orientations of Cartesian products of even cycles
- On optimal orientations of Cartesian products of even cycles and paths
- On optimal orientations of Cartesian products of graphs. I
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- On optimal orientations of Cartesian products of trees
- On optimal orientations of Cartesian products with a bipartite graph
- On optimal orientations of \(G\) vertex-multiplications
- Optimal orientations of products of paths and cycles
- Orientations of the n-cube with minimum diameter
- Robbins's Theorem for Mixed Multigraphs
- The diameter of an orientation of a complete multipartite graph
- The minimum diameter of orientations of complete multipartite graphs
Cited in
(5)
This page was built for publication: The orientation number of two complete graphs with linkages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556840)