Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657): Difference between revisions

@@ Property / cites work @@
+Adjacent Vertex Distinguishing Edge‐Colorings
@@ Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5419983
@@ Property / cites work: Q5419983 / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
+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 @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
+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 @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+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