On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105): Difference between revisions

@@ Property / author @@
-Hai Ying Wang
@@ Property / author: Hai Ying Wang / rank @@
-Normal rank
@@ Property / author @@
+Hai Ying Wang
@@ Property / author: Hai Ying Wang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9038-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2006857463
@@ Property / OpenAlex ID: W2006857463 / rank @@
+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 @@
+Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3366825
@@ Property / cites work: Q3366825 / rank @@
+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 @@
+Q4503707
@@ Property / cites work: Q4503707 / rank @@
+Normal rank