An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10255-007-7020-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2025895663
@@ Property / OpenAlex ID: W2025895663 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic edge colorings of graphs
@@ Property / cites work: Acyclic edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
+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 @@
+Strong edge colorings of graphs
@@ Property / cites work: Strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colouring and the probabilistic method
@@ Property / cites work: Graph colouring and the probabilistic method / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank