Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100): Difference between revisions

@@ Property / cites work @@
+On the 1-factors of a non-separable graph
@@ Property / cites work: On the 1-factors of a non-separable graph / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
+Normal rank
@@ Property / cites work @@
+Some improved bounds on the number of 1-factors of n-connected graphs
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of factorizable graphs
@@ Property / cites work: On the structure of factorizable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the 1-factors of n-connected graphs
@@ Property / cites work: On the 1-factors of n-connected graphs / rank @@
+Normal rank