Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272): Difference between revisions

@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
+Normal rank
@@ Property / cites work @@
+Q2829032
@@ Property / cites work: Q2829032 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+On the neighbor sum distinguishing total coloring of planar graphs
+Normal rank
@@ Property / cites work @@
+A note on the neighbor sum distinguishing total coloring of 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 colorings of triangle free planar graphs
+Normal rank
@@ Property / cites work @@
+Q2828964
@@ Property / cites work: Q2828964 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total coloring of 2-degenerate graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
+Normal rank