Systems of distant representatives

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 306-316

  Fiala, Jiří ^a   Kratochvíl, Jan ^a   Proskurowski, Andrzej ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

Graph labelings; Independent set; Metric space; Systems of representatives

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MAPPING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

GRAPH LABELING; INDEPENDENT SET; METRIC SPACE; SYSTEMS OF REPRESENTATIVES;

SET THEORY;

EID: 8344251899     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.02.018     Document Type: Article

References (28)

1. R. Aharoni, P. Haxell, Hall's theorem for hypergraphs, J. Graph Theory 35 (2000) 83-88.
2. R. Battiti, A.A. Bertossi, M.A. Bonuccelli, Assigning codes in wireless networks: Bounds and scaling properties, Wireless Networks 5 (3) (1999) 195-209.
3. G.J. Chang, D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996) 309-316.
4. D.G. Corneil, H. Lerchs, L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
5. S. Doddi, M.V. Marathe, A. Mirzaian, B.M.E. Moret, B. Zhu, Map labeling and its generalizations, in: Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 148-157.
6. J. Edmonds, Paths, trees and flowers, Canad. J. Math. 17 (1965) 449-467.
7. M. Farber, M. Hujter, Zs. Tuza, An upper bound on the number of cliques in a graph, Networks 23 (1993) 207-210.
8. M.R. Fellows, Transversals of vertex partitions in graphs, SIAM J. Discrete Math. 3 (2) (1990) 206-215.
9. J. Fiala, T. Kloks, J. Kratochvil, Discrete Appl. Math. 113 (1) (2001) 59-72.
10. J. Fiala, J. Kratochvil, A. Proskurowski, Distance constrained labelings of precolored trees, in: A. Restivo, S.R. Della Rocca, L. Roversi (Eds.), Theoretical Computer Science, ICTCS'02, Lecture Notes on Computer Science, vol. 2202, Springer, Berlin, 2001, pp. 285-292.
11. J. Fiala, J. Kratochvil, A. Proskurowski, Geometric systems of disjoint representatives, in: S.G. Kobourov, M.T. Goodrich (Eds.), Graph Drawing, GD'02, Lecture Notes in Computer Science, vol. 2528, Springer, Berlin, 2002, pp. 110-117.
12. D. Fotakis, G. Pantziou, G. Pentaris, P. Spirakis, Frequency assignment in mobile and radio networks, in: M. Mavronicolas, M. Merritt, N. Shavit (Eds.), Networks in distributed computing, DIMACS workshop, Ser. Discrete Math. Theor. Comput. Sci. 45 (1997) 73-90.
13. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman, San Francisco, 1979.
14. J.P. Georges, D.W. Mauro, On the size of graphs labeled with a condition at distance two, J. Graph. Theory 22 (1996) 47-57.
15. P. Golovach, Systems of q-pairs of distant representatives and graph colorings, Z. Nauch. Sernin. POMI 293 (2002)5-25 (in Russian).
16. J.R. Griggs, R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586-595.
17. P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935) 26-30.
18. J. van den Heuvel, R.A. Leese, M.A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory 29 (1998) 263-283.
19. M. Hujter, Zs. Tuza, Precoloring extension III, Classes of perfect graphs, Combin. Probab. Comput. 5 (1996) 35-56.
20. K. Jonas, Graph colorings analogues with a condition at distance two: L(2, 1)-labelings and list λ-labelings, Ph.D. thesis, University of South Carolina, 1993.
21. J. Kratochvil, A special planar satisfiability problem and a consequence of its NP-completeness, Discrete Appl. Math. 52 (1994) 233-252.
22. J. Kratochvil, A. Sebö, Coloring precolored perfect graphs, J. Graph Theory 25 (1997) 207-215.
23. D.D.-F. Liu, R.K. Yeh, On distance teo labellings of graph, ARS Combinatoria 47 (1997) 13-22.
24. J. Marks, S. Shieber, The computational complexity of cartographic label placement, Technical Report TR-05-91, Harvard CS, 1991.
25. R. Meshulam, The Clique Complex and Hypergraph Matching, Combinatorica 21 (2001) 89-94.
26. B. Simons, A fast algorithm for single processor scheduling, in: Proceedings of the 19th Annual Symposium Foundations of Computer Science, 1978, pp. 246-252.
27. R. Tamassia, Planar orthogonal drawings of graphs, in: Proceedings of the IEEE International Svmposhim on Circuits and Systems, 1990, pp. 319-322.
28. K.-Ch. Yeh, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, 1990.