On distance edge-colourings and matchings (Q2851479): Difference between revisions

@@ Property / cites work @@
+On the                       $b$                   -Independence Number of Sparse Random Graphs
+Normal rank
@@ Property / cites work @@
+Bounding the strong chromatic index of dense random graphs
+Normal rank
@@ Property / cites work @@
+Q4325283
@@ Property / cites work: Q4325283 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in bipartite graphs
@@ Property / cites work: Induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Strong Chromatic Index of Random Graphs
@@ Property / cites work: The Strong Chromatic Index of Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for finding distance-edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+A bound on the strong chromatic index of a graph
@@ Property / cites work: A bound on the strong chromatic index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4222086
@@ Property / cites work: Q4222086 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Upper Bound on the List Chromatic  Number of Locally Sparse Graphs
+Normal rank