The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720): Difference between revisions

@@ Property / cites work @@
+Q4028414
@@ Property / cites work: Q4028414 / 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 @@
+Q5480704
@@ Property / cites work: Q5480704 / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex-distinguishing proper edge-colorings of graphs
+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 @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+Q2857387
@@ Property / cites work: Q2857387 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on adjacent strong edge coloring of \(K(n,m)\)
+Normal rank
@@ Property / cites work @@
+Strong edge colorings of graphs
@@ Property / cites work: Strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total coloring of graphs with lower average degree
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
+Normal rank
@@ Property / cites work @@
+Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
+Normal rank