scientific article; zbMATH DE number 3991541

zbMATH Open0613.05035MaRDI QIDQ3754023FDOQ3754023

Ľubomír Šoltés

Publication date: 1986

Full work available at URL: https://eudml.org/doc/32222

Title of this publication is not available (Why is that?)

Recommendations

• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• The diameter of an orientation of a complete multipartite graph
• On optimal orientations of Cartesian products with a bipartite graph
• scientific article
• The diameter of strong orientations of strong products of graphs

zbMATH Keywords

orientationradiuscomplete bipartite graphsmallest diameter

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Cites Work

• Robbins's Theorem for Mixed Multigraphs
• Title not available (Why is that?)

Cited In (31)

• On optimal orientations of complete tripartite graphs
• Oriented diameter of maximal outerplanar graphs
• On the strong distance problems of pyramid networks
• Orientations of digraphs almost preserving diameter
• Title not available (Why is that?)
• The orientation number of two complete graphs with linkages
• Improved bounds for the oriented radius of mixed multigraphs
• On optimal orientations of Cartesian products of graphs. I
• On optimal orientation of cycle vertex multiplications
• Diameter three orientability of bipartite graphs
• Optimal oriented diameter of graphs with diameter 3
• Optimal orientations of products of paths and cycles
• Optimal orientations of vertex-multiplications of cartesian products of graphs
• Multipartite tournaments: a survey
• 3-kings in 3-partite tournaments
• The diameter of an orientation of a complete multipartite graph
• On optimal orientations of Cartesian products with a bipartite graph
• Kings in bipartite tournaments
• Large girth and small oriented diameter graphs
• Oriented diameter of graphs with diameter 3
• The minimum diameter of orientations of complete multipartite graphs
• On a conjecture concerning the orientation number of a graph
• The strong distance problem on the Cartesian product of graphs
• Title not available (Why is that?)
• On finding orientations with the fewest number of vertices with small out-degree
• AT-free graphs: Linear bounds for the oriented diameter
• Minimum average distance of strong orientations of graphs
• Minimizing and maximizing the diameter in orientations of graphs
• Diameter of orientations of graphs with given minimum degree
• A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
• Diameter-preserving orientations of the torus

This page was built for publication:

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