\(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795): Difference between revisions

@@ Property / cites work @@
+Vertex-distinguishing edge colorings of graphs
@@ Property / cites work: Vertex-distinguishing edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex-distinguishing proper edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / 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 @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+A note on adjacent strong edge coloring of \(K(n,m)\)
+Normal rank
@@ Property / cites work @@
+Q3024948
@@ Property / cites work: Q3024948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294976
@@ Property / cites work: Q5294976 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815316
@@ Property / cites work: Q3815316 / rank @@
+Normal rank
@@ Property / cites work @@
+The complete chromatic number of some planar graphs
+Normal rank
@@ Property / cites work @@
+Q4016072
@@ Property / cites work: Q4016072 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037761
@@ Property / cites work: Q4037761 / rank @@
+Normal rank
@@ Property / cites work @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank
@@ Property / cites work @@
+Q4934402
@@ Property / cites work: Q4934402 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank