Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519): Difference between revisions

@@ 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.1016/j.disc.2008.06.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2009043562
@@ Property / OpenAlex ID: W2009043562 / 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 @@
+On the vertex-distinguishing proper edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
+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 @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank
@@ Property / cites work @@
+On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
+Normal rank