Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834): 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 @@
+On the vertex-distinguishing proper edge-colorings of graphs
+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 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 @@
+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 @@
+Q4865126
@@ Property / cites work: Q4865126 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic behaviour of the observability of \(Q_ n\)
+Normal rank
@@ Property / cites work @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank