Extremal threshold graphs for matchings and independent sets (Q1756116): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-018-1941-5
@@ Property / DOI: 10.1007/s00373-018-1941-5 / rank @@
-Normal rank
@@ Property / cites work @@
+Graphs with maximal number of adjacent pairs of edges
+Normal rank
@@ Property / cites work @@
+Extremal problems for independent set enumeration
@@ Property / cites work: Extremal problems for independent set enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071752
@@ Property / cites work: Q4071752 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with the fewest matchings
@@ Property / cites work: Graphs with the fewest matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5726070
@@ Property / cites work: Q5726070 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4261184
@@ Property / cites work: Q4261184 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129289047
@@ Property / Wikidata QID: Q129289047 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-018-1941-5
@@ Property / DOI: 10.1007/S00373-018-1941-5 / rank @@
+Normal rank