Pages that link to "Item:Q1712789"
From MaRDI portal
The following pages link to Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789):
Displaying 6 items.
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (Q6094709) (← links)
- Some results on (strong) total proper connection number of some digraphs (Q6611051) (← links)