Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159): Difference between revisions

@@ Property / cites work @@
+How to Define an Irregular Graph
@@ Property / cites work: How to Define an Irregular Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3824455
@@ Property / cites work: Q3824455 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing index
@@ Property / cites work: Neighbor sum distinguishing index / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+A bound on the total chromatic number
@@ Property / cites work: A bound on the total chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal list colorings
@@ Property / cites work: Near-optimal list colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colouring and the probabilistic method
@@ Property / cites work: Graph colouring and the probabilistic method / rank @@
+Normal rank
@@ Property / cites work @@
+On the total-neighbor-distinguishing index by sums
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal neighbour sum distinguishing colourings of graphs
+Normal rank
@@ Property / cites work @@
+Q5564127
@@ Property / cites work: Q5564127 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of triangle free planar graphs
+Normal rank