On the neighbour-distinguishing index of a graph (Q855303): Difference between revisions

@@ Property / cites work @@
+Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
+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 @@
+On the vertex-distinguishing proper edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886768
@@ Property / cites work: Q4886768 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge colorings of graphs
@@ Property / cites work: Strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+Q4865126
@@ Property / cites work: Q4865126 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic behaviour of the observability of \(Q_ n\)
+Normal rank
@@ Property / cites work @@
+Total colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank