Pages that link to "Item:Q367076"
From MaRDI portal
The following pages link to Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076):
Displaying 11 items.
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings (Q5103954) (← links)
