Pages that link to "Item:Q5167722"
From MaRDI portal
The following pages link to Oriented diameter and rainbow connection number of a graph (Q5167722):
Displayed 10 items.
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter (Q5042233) (← links)
- Improved bounds for the oriented radius of mixed multigraphs (Q6047957) (← links)