The following pages link to (Q4014618):
Displayed 6 items.
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph (Q2078840) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph (Q5087058) (← links)
- Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (Q6094709) (← links)