Pages that link to "Item:Q681264"
From MaRDI portal
The following pages link to Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264):
Displaying 9 items.
- Total rainbow connection number and complementary graph (Q310863) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- (Q2987164) (← links)
- Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings (Q5103954) (← links)