Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496): Difference between revisions

@@ Property / author @@
-Daniel Král'
@@ Property / author: Daniel Král' / rank @@
-Normal rank
@@ Property / author @@
+Daniel Král'
@@ Property / author: Daniel Král' / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2009.07.068
+Normal rank
@@ Property / OpenAlex ID @@
+W2003777791
@@ Property / OpenAlex ID: W2003777791 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57601457
@@ Property / Wikidata QID: Q57601457 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings in planar cubic graphs
@@ Property / cites work: Perfect matchings in planar cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Brick decompositions and the matching rank of graphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Rank of maximum matchings in a graph
@@ Property / cites work: Rank of maximum matchings in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Counting 1-factors in regular bipartite graphs
@@ Property / cites work: Counting 1-factors in regular bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4184837
@@ Property / cites work: Q4184837 / rank @@
+Normal rank