Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-019-00465-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2982029498
@@ Property / OpenAlex ID: W2982029498 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+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 chromatic number
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+A note on the adjacent vertex distinguishing total chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+Concise proofs for adjacent vertex-distinguishing total colorings
+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 @@
+Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
+Normal rank
@@ Property / cites work @@
+AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
+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 @@
+An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
+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 @@
+The adjacent vertex distinguishing total coloring of planar graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
+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
@@ Property / Wikidata QID @@
+Q127025921
@@ Property / Wikidata QID: Q127025921 / rank @@
+Normal rank