Covering graphs with matchings of fixed size (Q960925): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2008.09.031
@@ Property / DOI: 10.1016/j.disc.2008.09.031 / 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.disc.2008.09.031
+Normal rank
@@ Property / OpenAlex ID @@
+W2021614430
@@ Property / OpenAlex ID: W2021614430 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424771
@@ Property / cites work: Q3424771 / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum sets of 1-factors covering a complete multipartite graph
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5604409
@@ Property / cites work: Q5604409 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+The Solution of a Timetabling Problem
@@ Property / cites work: The Solution of a Timetabling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5650698
@@ Property / cites work: Q5650698 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2008.09.031
@@ Property / DOI: 10.1016/J.DISC.2008.09.031 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:960925