Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813): Difference between revisions

@@ Property / author @@
-Yu-Lin Chang
@@ Property / author: Yu-Lin Chang / rank @@
-Normal rank
@@ Property / author @@
-Guang-Hui Wang
@@ Property / author: Guang-Hui Wang / rank @@
-Normal rank
@@ Property / author @@
+Yu-Lin Chang
@@ Property / author: Yu-Lin Chang / rank @@
+Normal rank
@@ Property / author @@
+Guang-Hui Wang
@@ Property / author: Guang-Hui Wang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2020.112014
+Normal rank
@@ Property / OpenAlex ID @@
+W3032928471
@@ Property / OpenAlex ID: W3032928471 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial method and restricted sums of congruence classes
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings of plane graphs: a survey
@@ Property / cites work: Colorings of plane graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
+Normal rank
@@ Property / cites work @@
+On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
+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 choosability of planar graphs with maximum degree at least eleven
+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 @@
+Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
+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 @@
+Adjacent vertex distinguishing total colorings of 2-degenerate graphs
+Normal rank
@@ Property / cites work @@
+On the AVDTC of 4-regular graphs
@@ Property / cites work: On the AVDTC of 4-regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
+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 the total coloring of certain graphs
@@ Property / cites work: On the total coloring of certain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+On Total Chromatic Number of a Graph
@@ Property / cites work: On Total Chromatic Number of a Graph / rank @@
+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 @@
+Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total colorings of outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
+Normal rank
@@ Property / cites work @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank