The orientation number of two complete graphs with linkages

DOI10.1016/J.DISC.2005.02.010zbMATH Open1064.05071OpenAlexW1979579415MaRDI QIDQ556840FDOQ556840

Authors: K. L. Ng, K. M. Koh 

Publication date: 23 June 2005

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

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

Recommendations

• On a conjecture concerning the orientation number of a graph
• scientific article
• On optimal orientations of complete tripartite graphs
• Optimal orientations of subgraphs of complete bipartite graphs
• Optimal orientations of some complete tripartite graphs

zbMATH Keywords

diameter

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Robbins's Theorem for Mixed Multigraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Diameter-preserving orientations of the torus
• Minimizing and maximizing the diameter in orientations of graphs
• Title not available (Why is that?)
• On optimal orientations of Cartesian products of graphs. I
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• Every vertex a king
• Optimal orientations of products of paths and cycles
• On optimal orientations of \(G\) vertex-multiplications
• The diameter of an orientation of a complete multipartite graph
• On optimal orientations of Cartesian products with a bipartite graph
• The minimum diameter of orientations of complete multipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diametrically critical tournaments
• On optimal orientations of Cartesian products of even cycles and paths
• On optimal orientations of Cartesian products of even cycles
• 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
• Orientations of the n-cube with minimum diameter

Cited In (5)

• The complexity of two graph orientation problems
• On fully orientability of 2-degenerate graphs
• Large girth and small oriented diameter graphs
• On a conjecture concerning the orientation number of a graph
• Diameter of orientations of graphs with given minimum degree

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)