Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610): Difference between revisions

@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total coloring of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing list total coloring of subcubic graphs
+Normal rank
@@ Property / cites work @@
+On the total-neighbor-distinguishing index by sums
+Normal rank
@@ Property / cites work @@
+Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total choosability of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total coloring of sparse IC-planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total chromatic number of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
+Normal rank
@@ Property / cites work @@
+Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
+Normal rank