On the complexity of the flow coloring problem (Q499367): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.06.025
+Normal rank
@@ Property / OpenAlex ID @@
+W759230654
@@ Property / OpenAlex ID: W759230654 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge-colouring and induced matchings
@@ Property / cites work: Strong edge-colouring and induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for finding distance-edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+Q5417627
@@ Property / cites work: Q5417627 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of bandwidth allocation in radio networks
+Normal rank
@@ Property / cites work @@
+On the computational complexity of strong edge coloring
+Normal rank
@@ Property / cites work @@
+A note on the strong chromatic index of bipartite graphs
+Normal rank
@@ Property / cites work @@
+The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Solving the 2-disjoint paths problem in nearly linear time
+Normal rank