Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498): Difference between revisions

@@ Property / cites work @@
+Q4028414
@@ Property / cites work: Q4028414 / rank @@
+Normal rank
@@ Property / cites work @@
+\(r\)-strong edge colorings of graphs
@@ Property / cites work: \(r\)-strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing edge colorings of graphs
@@ Property / cites work: Vertex-distinguishing 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 @@
+Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge colorings of graphs
@@ Property / cites work: Strong edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+(d,1)-total labeling of graphs with a given maximum average degree
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring of graphs / rank @@
+Normal rank