On a conjecture concerning the orientation number of a graph

DOI10.1016/j.disc.2008.02.039zbMath1213.05141WikidataQ123009357 ScholiaQ123009357MaRDI QIDQ1024476

J. Martínez

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.039

zbMATH Keywords

digraph; optimal orientation; orientation number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C20: Directed graphs (digraphs), tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The orientation number of two complete graphs with linkages
• Orientations of the n-cube with minimum diameter
• Every vertex a king
• Minimizing and maximizing the diameter in orientations of graphs
• Optimal orientations of products of paths and cycles
• On optimal orientations of \(G\) vertex-multiplications
• On optimal orientations of Cartesian products of graphs. I
• The diameter of an orientation of a complete multipartite graph
• On optimal orientations of Cartesian products with a bipartite graph
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• The minimum diameter of orientations of complete multipartite graphs
• Robbins's Theorem for Mixed Multigraphs
• Diametrically critical tournaments
• On optimal orientations of Cartesian products of even cycles and paths
• Diameter-preserving orientations of the torus
• On optimal orientations of Cartesian products of even cycles
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• On optimal orientations of Cartesian products of trees
• On a conjecture concerning optimal orientations of the Cartesian product of a triangle and an odd cycle