On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658): 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 @@
+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 @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+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