Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628): 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 @@
+Q5708983
@@ Property / cites work: Q5708983 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305536
@@ Property / cites work: Q4305536 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5613121
@@ Property / cites work: Q5613121 / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
+Normal rank
@@ Property / cites work @@
+Q2878220
@@ Property / cites work: Q2878220 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5632603
@@ Property / cites work: Q5632603 / rank @@
+Normal rank
@@ Property / cites work @@
+On connected cutfree domination in graphs
@@ Property / cites work: On connected cutfree domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination-balanced graphs
@@ Property / cites work: Domination-balanced graphs / rank @@
+Normal rank