Edge colorings of the direct product of two graphs (Q2354610): 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 @@
+Q5480704
@@ Property / cites work: Q5480704 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2864442
@@ Property / cites work: Q2864442 / rank @@
+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 @@
+Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle
+Normal rank
@@ Property / cites work @@
+\(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+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 @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacent vertex distinguishing edge-colorings of graphs with smaller 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