Nordhaus-Gaddum type result for the matching number of a graph (Q1680497): Difference between revisions

@@ Property / cites work @@
+A survey of Nordhaus-Gaddum type relations
@@ Property / cites work: A survey of Nordhaus-Gaddum type relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5183522
@@ Property / cites work: Q5183522 / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus–Gaddum‐type Theorems for decompositions into many parts
+Normal rank
@@ Property / cites work @@
+Some nordhaus‐‐ gaddum‐type results
@@ Property / cites work: Some nordhaus‐‐ gaddum‐type results / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type relations of three graph coloring parameters
+Normal rank
@@ Property / cites work @@
+On complementary graphs with no isolated vertices
@@ Property / cites work: On complementary graphs with no isolated vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
+Normal rank
@@ Property / cites work @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Nordhaus-Gaddum inequalities for domination.
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts
+Normal rank