The L(2,1)-labeling of unigraphs

Discrete Applied Mathematics

Volumn 159, Issue 12, 2011, Pages 1196-1206

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Frequency assignment; L(2,1) labeling; Unigraphs

Indexed keywords

ADJACENT NODES; DEGREE SEQUENCE; FREQUENCY ASSIGNMENTS; GRAPH G; L(2 , 1)-LABELING; NP COMPLETE; UNIGRAPHS;

ALGORITHMS;

COLOR;

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

References (15)

1. T. Araki Labeling bipartite permutation graphs with a condition at distance two Discrete Appl. Math. 157 8 2009 1677 1686
2. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen λ-coloring of graphs Proc. of 17th International Symposium on Theoretical Aspects of Computer Science STACS 2000 LNCS vol. 1770 2000 395 406
3. A. Borri, T. Calamoneri, and R. Petreschi Recognition of unigraphs through superposition of graphs Proc. of Whorkshop on Algorithms and Computation WALCOM 2009 Lecture Notes in Computer Science vol. 5431 2009 165 176
4. T. Calamoneri, The L (h, k ) -labelling problem: An updated survey and annotated bibliography, Comput. J. (2011), in press (doi:10.1093/comjnl/bxr037 ).
5. T. Calamoneri, S. Caminiti, S. Olariu, and R. Petreschi On the L (h, k ) -labeling co-comparability graphs and circular-arc graphs Networks 53 1 2009 27 34
6. T. Calamoneri, and R. Petreschi L (h, 1 ) -labeling subclasses of planar graphs J. Parallel Distrib. Comput. 64 3 2004 414 426
7. T. Calamoneri, and R. Petreschi Lambda-coloring matrogenic graphs Discrete Appl. Math. 154 2006 2445 2457
8. G.J. Chang, and D. Kuo The L (2, 1 ) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
9. J. Fiala, T. Kloks, and J. Kratochvl Fixed-parameter complexity of λ-labelings WG99 Proc. Graph-Theoretic Concepts of Compu. Sci. vol. 1665 1999 350 363
10. J.R. Griggs, and R.K. Yeh Labeling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586 595
11. R.H. Johnson Simple separable graphs Pacific J. Math. 56 1 1975 143 158
12. S.Y. Li Graphic sequences with unique realization J. Combin. Theory Ser. B 19 1 1975 42 68
13. N.V.R. Mahadev, and U.N. Peled Threshold Graphs and Related Topics Ann. Discrete Math. vol. 56 1995 North-Holland Amsterdam
14. D. Sakai Labeling chordal graphs: distance two condition SIAM J. Discrete Math. 7 1994 133 140
15. R. Tyshkevich Decomposition of graphical sequences and unigraphs Discrete Math. 220 2000 201 238