Achieving maximum chromatic index in multigraphs (Q1025461): Difference between revisions

@@ Property / cites work @@
+On the fractional chromatic index of a graph and its complement
+Normal rank
@@ Property / cites work @@
+Q3118960
@@ Property / cites work: Q3118960 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Edge-coloring of multigraphs: Recoloring technique
+Normal rank
@@ Property / cites work @@
+Q4056033
@@ Property / cites work: Q4056033 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic index of multigraphs without large triangles
+Normal rank
@@ Property / cites work @@
+On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
+Normal rank
@@ Property / cites work @@
+A Theorem on Coloring the Lines of a Network
@@ Property / cites work: A Theorem on Coloring the Lines of a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527280
@@ Property / cites work: Q4527280 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4517442
@@ Property / cites work: Q4517442 / rank @@
+Normal rank