Edge $k$-$q$-Colorability of Graphs (Q4637664): Difference between revisions

@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Path decompositions of multigraphs
@@ Property / cites work: Path decompositions of multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the sum of squares of degrees in a graph
+Normal rank
@@ Property / cites work @@
+Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
+Normal rank
@@ Property / cites work @@
+From the theory of regular graphs of third and fourth degree
+Normal rank
@@ Property / cites work @@
+Q4262251
@@ Property / cites work: Q4262251 / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-max Edge q-Coloring Problem
@@ Property / cites work: The Min-max Edge q-Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-Max Edge q-Coloring Problem
@@ Property / cites work: The Min-Max Edge q-Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5539649
@@ Property / cites work: Q5539649 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+-Factors and Antifactor Sets
@@ Property / cites work: 1-Factors and Antifactor Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank