Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524): Difference between revisions

@@ Property / cites work @@
+Vertex-colouring edge-weightings
@@ Property / cites work: Vertex-colouring edge-weightings / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained subgraphs
@@ Property / cites work: Degree constrained subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Irregular Assignments of Trees and Forests
@@ Property / cites work: Irregular Assignments of Trees and Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Weight choosability of graphs
@@ Property / cites work: Weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the irregularity strength of trees
@@ Property / cites work: On the irregularity strength of trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the Neighbor Sum Distinguishing Index of Planar Graphs
+Normal rank
@@ Property / cites work @@
+How to Define an Irregular Graph
@@ Property / cites work: How to Define an Irregular Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3824455
@@ Property / cites work: Q3824455 / rank @@
+Normal rank
@@ Property / cites work @@
+Irregularity strength of dense graphs
@@ Property / cites work: Irregularity strength of dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the irregularity strength of them ×n grid
@@ Property / cites work: On the irregularity strength of them ×n grid / rank @@
+Normal rank
@@ Property / cites work @@
+NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3474681
@@ Property / cites work: Q3474681 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing index
@@ Property / cites work: Neighbor sum distinguishing index / rank @@
+Normal rank
@@ Property / cites work @@
+On graph irregularity strength
@@ Property / cites work: On graph irregularity strength / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+A New Upper Bound for the Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Edge weights and vertex colours
@@ Property / cites work: Edge weights and vertex colours / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873753
@@ Property / cites work: Q4873753 / rank @@
+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 @@
+On the Irregularity Strength of Dense Graphs
@@ Property / cites work: On the Irregularity Strength of Dense Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the total chromatic number
@@ Property / cites work: A bound on the total chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Bound on the Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+On the total-neighbor-distinguishing index by sums
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal neighbour sum distinguishing colourings of graphs
+Normal rank
@@ Property / cites work @@
+Irregularity strength of regular graphs
@@ Property / cites work: Irregularity strength of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
+Normal rank
@@ Property / cites work @@
+Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
+Normal rank
@@ Property / cites work @@
+Q3575472
@@ Property / cites work: Q3575472 / 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 @@
+SOME UNSOLVED PROBLEMS IN GRAPH THEORY
@@ Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing index of planar graphs
+Normal rank
@@ Property / cites work @@
+Every graph is \((2,3)\)-choosable
@@ Property / cites work: Every graph is \((2,3)\)-choosable / 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 @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank