Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aml.2011.05.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2094198882
@@ Property / OpenAlex ID: W2094198882 / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent strong edge coloring of graphs
@@ Property / cites work: Adjacent strong edge coloring 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 @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
+Normal rank
@@ Property / cites work @@
+Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of graphs with smaller 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 @@
+Coloring the square of a \(K_{4}\)-minor free graph
+Normal rank