Matching extension and minimum degree (Q1363649): Difference between revisions

@@ Property / author @@
-Nawarat Ananchuen
@@ Property / author: Nawarat Ananchuen / rank @@
-Normal rank
@@ Property / author @@
+Nawarat Ananchuen
@@ Property / author: Nawarat Ananchuen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4033687
@@ Property / cites work: Q4033687 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4304325
@@ Property / cites work: Q4304325 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320680
@@ Property / cites work: Q4320680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending subpermutation matrices in regular classes of matrices
+Normal rank
@@ Property / cites work @@
+Minimum degree of bipartite graphs and the existence of k-factors
+Normal rank
@@ Property / cites work @@
+On defect-d matchings in graphs
@@ Property / cites work: On defect-d matchings in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3800093
@@ Property / cites work: Q3800093 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending matchings in graphs: A survey
@@ Property / cites work: Extending matchings in graphs: A survey / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(95)00352-w
+Normal rank
@@ Property / OpenAlex ID @@
+W1973436029
@@ Property / OpenAlex ID: W1973436029 / rank @@
+Normal rank