Using euler partitions to edge color bipartite multigraphs (Q4198790): Difference between revisions

@@ Property / Wikidata QID @@
+Q29028581
@@ Property / Wikidata QID: Q29028581 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5619846
@@ Property / cites work: Q5619846 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5518886
@@ Property / cites work: Q5518886 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4136942
@@ Property / cites work: Q4136942 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4198790