Graphs with the maximum or minimum number of 1-factors (Q965940): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.disc.2009.08.016
-Normal rank
@@ Property / OpenAlex ID @@
-W2040611023
@@ Property / OpenAlex ID: W2040611023 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2009.08.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2040611023
@@ Property / OpenAlex ID: W2040611023 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of perfect matchings in graphs with a given degree sequence
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities for the gamma function with applications to permanents
+Normal rank
@@ Property / cites work @@
+Comparison of graphs by their number of spanning trees
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / 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 @@
+Inequalities: theory of majorization and its applications
+Normal rank
@@ Property / cites work @@
+Topics in Intersection Graph Theory
@@ Property / cites work: Topics in Intersection Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A new technique for the characterization of graphs with a maximum number of spanning trees
+Normal rank
@@ Property / cites work @@
+A reliability-improving graph transformation with applications to network reliability
+Normal rank
@@ Property / cites work @@
+Maximizing the number of spanning trees in a graph with n nodes and m edges
+Normal rank