λ-Coloring matrogenic graphs

Discrete Applied Mathematics

Volumn 154, Issue 17, 2006, Pages 2445-2457

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Coloring; Cographs; Matrogenic graphs; Matroidal graphs; Split graphs; Threshold graphs

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); NUMERICAL METHODS; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

Λ-COLORING; COGRAPHS; MATROGENIC GRAPHS; MATROIDAL GRAPHS; SPLIT GRAPHS; THRESHOLD GRAPHS;

GRAPH THEORY;

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

References (18)

1. A.A. Bertossi, C. Pinotti, R. Tan, L (2, 1)- and L (2, 1, 1)-Labeling of graphs with application to channel assignment in wireless networks, Proceedings of the ACM DIAL M, 2000.
2. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, λ-Coloring of graphs, Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science, vol. 1770, 2000, pp. 395-406.
3. A. Brandstadt, V.B. Le, J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.
4. T. Calamoneri, The L (h, k)-Labelling Problem: A Survey and Annotated Bibliography, accepted for publication on The Computer Journal, 2006. An always updated version is available at: http://www.dsi.uniromal.it/∼calamo/survey.html.
5. Calamoneri T., and Petreschi R. The L (2, 1)-labeling of planar graphs. J. Parallel and Distributed Comput. 64 3 (2004) 414-426
6. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
7. Chvatal V., and Hammer P. Aggregation of inequalities integer programming. Ann Discrete Math. 1 (1977) 145-162
8. J. Fiala, T. Kloks, J. Kratochvíl, Fixed-parameter complexity of λ-labelings, Proceedings of the Graph-Theoretic Concepts of Computer Science (WG99), Lecture Notes in Computer Science, vol. 1665, 1999, pp. 350-363.
9. Foldes S., and Hammer P. On a class of matroid producing graphs. Colloq. Math. Soc. J. Bolyai (Combinatorics) 18 (1978) 331-352
10. Garey M.R., and Johnson D.S. Computers and Intractability-A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co.
11. M.C. Golumbic, A.N. Trenk, Tolerance graphs, Cambridge Studies in Advanced Mathematics, 2004.
12. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
13. Henderson P.H., and Zalcstein Y. A graph-theoretic characterization of the PV-chunk class of synchronizing primitives. SIAM J. Comput. 6 (1977) 88-108
14. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
15. N.V.R. Mahadev, U.N. Peled, Threshold graphs and related topics, Ann. Discrete Math. 56 (1995).
16. Marchioro P., Morgana A., Petreschi R., and Simeone B. Degree sequences of matrogenic graphs. Discrete Math. 51 (1984) 47-61
17. Peled U.N. Matroidal graphs. Discrete Math. 20 (1977) 263-286
18. Sakai D. Labeling chordal graphs: distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140