The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052): Difference between revisions

@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total chromatic number
+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 @@
+A note on the adjacent vertex distinguishing total chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+The total chromatic number of any multigraph with maximum degree five is at most seven
+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 @@
+Q2811835
@@ Property / cites work: Q2811835 / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total colorings of 2-degenerate graphs
+Normal rank
@@ Property / cites work @@
+On the total-neighbor-distinguishing index by sums
+Normal rank
@@ Property / cites work @@
+On the neighbor sum distinguishing total coloring of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total choosability of planar graphs
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
+Normal rank
@@ Property / cites work @@
+On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
+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