The channel assignment problem for mutually adjacent sites (Q1336445): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0097-3165(94)90096-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2020496790
@@ Property / OpenAlex ID: W2020496790 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences of integers with missing differences
@@ Property / cites work: Sequences of integers with missing differences / rank @@
+Normal rank
@@ Property / cites work @@
+Q3322121
@@ Property / cites work: Q3322121 / rank @@
+Normal rank
@@ Property / cites work @@
+Sets of integers with missing differences
@@ Property / cites work: Sets of integers with missing differences / rank @@
+Normal rank
@@ Property / cites work @@
+\(T\)-colorings of graphs
@@ Property / cites work: \(T\)-colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Asymptotic Approach to the Channel Assignment Problem
+Normal rank
@@ Property / cites work @@
+Further Results on T-Coloring and Frequency Assignment Problems
+Normal rank
@@ Property / cites work @@
+Q4873773
@@ Property / cites work: Q4873773 / rank @@
+Normal rank
@@ Property / cites work @@
+On Infinite-Difference Sets
@@ Property / cites work: On Infinite-Difference Sets / rank @@
+Normal rank
@@ Property / cites work @@
+List \(T\)-colorings of graphs
@@ Property / cites work: List \(T\)-colorings of graphs / rank @@
+Normal rank