Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657): 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 @@
+On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
+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 @@
+Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+On the total-neighbor-distinguishing index by sums
+Normal rank
@@ Property / cites work @@
+Bounding the weight choosability number of a graph
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total coloring of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of triangle free planar graphs
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total colorings of outerplanar graphs
+Normal rank
@@ Property / cites work @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank