Author:
Janczewski Robert,Turowski Krzysztof
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Bodlaender, H.L., Broersma, H., Fomin, F.V., Pyatkin, A.V., Woeginger, G.J.: Radio labeling with preassigned frequencies. SIAM J. Optim. 15(1), 1–16 (2005)
2. Broersma, H.J.: A general framework for coloring problems: old results, new results, and open problems. In: Combinatorial Geometry and Graph Theory, pp. 65–79. Springer, Berlin, Heidelberg (2003)
3. Broersma, H., Fomin, F., Golovach, P., Woeginger, G.: Backbone colorings for graphs: tree and path backbones. J. Graph Theory 55(2), 137–152 (2007)
4. Broersma, H., Fujisawa, J., Marchal, B., Paulusma, D., Salman, A.N.M., Yoshimoto, K.: $$\lambda $$ λ -backbone colorings along pairwise disjoint stars and matchings. Discrete Math. 309(18), 5596–5609 (2009)
5. Comellas, F., Ozon, J.: Graph coloring algorithms for assignment problems in radio networks. In: Applications of Neural Networks to Telecommunications in Radio, Networks, pp. 49–56 (1995)