A Theorem about the Channel Assignment Problem
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 16 (3) , 426-437
- https://doi.org/10.1137/s0895480101399449
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the span in channel assignment problems: bounds, computing and countingDiscrete Mathematics, 2003
- Graph Colouring and the Probabilistic MethodPublished by Springer Nature ,2002
- Brooks‐type theorems for choosability with separationJournal of Graph Theory, 1998
- Graph colorings with local constraints -- a surveyDiscussiones Mathematicae Graph Theory, 1997
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Three short proofs in graph theoryJournal of Combinatorial Theory, Series B, 1975
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941