On the adjacent vertex distinguishing edge colourings of graphs (Q3568414): Difference between revisions

@@ Property / cites work @@
+\(r\)-strong edge colorings of graphs
@@ Property / cites work: \(r\)-strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent Vertex Distinguishing Edge‐Colorings
@@ Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing edge colorings of graphs
@@ Property / cites work: Vertex-distinguishing edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On the neighbour-distinguishing index of a graph
@@ Property / cites work: On the neighbour-distinguishing index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank