Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754): Difference between revisions

@@ Property / cites work @@
+\(r\)-strong edge colorings of graphs
@@ Property / cites work: \(r\)-strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent Vertex Distinguishing Edge‐Colorings
@@ Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On the Neighbor Sum Distinguishing Index of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
+Normal rank
@@ Property / cites work @@
+On the neighbour-distinguishing index of a graph
@@ Property / cites work: On the neighbour-distinguishing index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing index
@@ Property / cites work: Neighbor sum distinguishing index / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+On Neighbor-Distinguishing Index of Planar Graphs
@@ Property / cites work: On Neighbor-Distinguishing Index of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal neighbour sum distinguishing colourings 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 @@
+Neighbor sum distinguishing index of planar graphs
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
+Normal rank
@@ Property / cites work @@
+Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank