The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-016-0004-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2335742916
@@ Property / OpenAlex ID: W2335742916 / rank @@
+Normal rank
@@ 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 @@
+Additive coloring of planar graphs
@@ Property / cites work: Additive coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total chromatic number
+Normal rank
@@ Property / cites work @@
+Antimagic labelling of vertex weighted graphs
@@ Property / cites work: Antimagic labelling of vertex weighted graphs / 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 edge colorings of graphs with bounded maximum average degree
+Normal rank
@@ Property / cites work @@
+Weighted-1-antimagic graphs of prime power order
@@ Property / cites work: Weighted-1-antimagic graphs of prime power order / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the adjacent vertex distinguishing total chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Irregularity strength of regular graphs
@@ Property / cites work: Irregularity strength of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the neighbor sum distinguishing total coloring of planar graphs
+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 @@
+Adjacent vertex distinguishing total coloring of graphs with lower average degree
+Normal rank
@@ Property / cites work @@
+An improved upper bound for the neighbor sum distinguishing index of graphs
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing index of planar 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 @@
+Adjacent vertex distinguishing total colorings of outerplanar graphs
+Normal rank
@@ Property / cites work @@
+The adjacent vertex distinguishing total coloring of planar graphs
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On adjacent-vertex-distinguishing total coloring of graphs
+Normal rank