A note on maximum size of a graph without isolated vertices under the given matching number (Q6095058): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2023.128295
@@ Property / DOI: 10.1016/j.amc.2023.128295 / rank @@
-Normal rank
@@ Property / cites work @@
+Connected graphs without long paths
@@ Property / cites work: Connected graphs without long paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3258698
@@ Property / cites work: Q3258698 / rank @@
+Normal rank
@@ Property / cites work @@
+Turán's theorem and <i>k</i>‐connected graphs
@@ Property / cites work: Turán's theorem and <i>k</i>‐connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
+Normal rank
@@ Property / cites work @@
+Maximum size of a graph with given fractional matching number
+Normal rank
@@ Property / cites work @@
+Q4382863
@@ Property / cites work: Q4382863 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5781249
@@ Property / cites work: Q5781249 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Turán's theorem
@@ Property / cites work: A note on Turán's theorem / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2023.128295
@@ Property / DOI: 10.1016/J.AMC.2023.128295 / rank @@
+Normal rank