L(2, 1)-coloring matrogenic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 236-247

  Calamoneri, Tiziana ^a   Petreschi, Rossella ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cographs; L(21) Coloring; Matrogenic graphs; Split graphs; Threshold graphs

Indexed keywords

CLUSTERING ALGORITHMS; GRAPH THEORY;

ADJACENT VERTICES; CO-GRAPHS; L (2 , 1) COLORING; LINEAR-TIME ALGORITHMS; MATROGENIC GRAPHS; OPTIMAL SOLUTIONS; SPLIT GRAPHS; THRESHOLD GRAPHS;

GRAPHIC METHODS;

EID: 35248849592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_24     Document Type: Conference Paper

References (15)

1. Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: λ-Coloring of Graphs. Proc. of 17th Int.l Symp. on Theoretical Aspects of Computer Science (STACS 2000) LNCS 1770 (2000) 395–406
2. Bertossi, A.A., Pinotti, C., Tan, R.: L(2, 1)-and L(2, 1, 1)-Labeling of Graphs with Application to Channel Assignment in Wireless Networks. Proc. of the 4th ACM Int.l Workshop on Disc. Alg. and Methods for Mobile Compu. and Comm. (DIAL M) (2000)
3. Calamoneri, T., Petreschi, R.: The L(2, 1)-Labeling of Planar Graphs. Proc. of the 5th ACM Int.l Workshop on Disc. Alg. and Methods for Mobile Compu. and Comm. (DIAL M) (2001) 28–33
4. Calamoneri, T., Petreschi, R.: L(2, 1)-Coloring of Regular Tiling. 1st Cologne-Twente Workshop (CTW ‘01) (2001)
5. Calamoneri, T., Petreschi, R.: λ-Coloring Unigraphs. Manuscript (2001)
6. Chang, G.J., Ke, W., Kuo, D., Liu, D., Yeh, R.: On L(d, 1)-Labeling of Graphs. Disc. Math. 220 (2000) 57–66
7. Chang, G.J., Kuo, D.: The L(2, 1)-labeling Problem on Graphs. SIAM J. Disc. Math. 9 (1996) 309–316
8. Chvatal, V., Hammer, P.: Aggregation of inequalities integer programming. Ann Discrete Math 1 (1977) 145–162
9. Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-parameter Complexity of λ-Labelings. Proc. Graph-Theoretic Concepts of Compu. Sci. (WG99) LNCS 1665 (1999) 350–363
10. Foldes, S., Hammer, P.: On a class of matroid producing graphs. Colloq. Math.Soc.J. Bolyai (Combinatorics), 18 (1978) 331–352
11. Griggs, J.R., Yeh, R.K.: Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math 5 (1992) 586–595
12. Henderson, P.H., Zalcstein, Y.: A graph-theoretic characterization of the PV-chunk class of syncronizing primitives. SIAM J. Comput. 6 (1977) 88–108
13. Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math. 56, North-Holland, Amsterdam (1995)
14. Marchioro, P., Morgana, A., Petreschi, R., Simeone, B.: Degree sequences of matrogenic graphs. Discrete Math. 51 (1984) 47–61
15. Sakai D.: Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math 7 (1994) 133–140