Lambda Composition

Journal of Graph Theory

Volumn 26, Issue 1, 1997, Pages 9-16

  Cameron, Kathie ^a   Edmonds, Jack ^b  

^a WILFRID LAURIER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Camparability graph; Duplication of nodes; Graph substitution; Lambda subgraph; Perfect graph

Indexed keywords

EID: 0031497837     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199709)26:1<9::AID-JGT2>3.0.CO;2-N     Document Type: Article

References (9)

1. J. C. Arditti, Graphs de comparabilité et dimension des ordres, Note de recherches CRM 607 (Centre de Recherche Mathématique de l'Université de Montréal, Montréal, 1976).
2. K. Cameron, J. Edmonds, and L. Lovász, A note on perfect graphs, Periodica Math. Hungar. 17(3) (1986), 411-447.
3. T. Gallai, Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar. 18 (1967), 25-66. MR 36 #5026.
4. A. Ghouila-Houri, Characterisation des graphes non orientés dont on peut orienter les arrêtes de manière à obtenir le graph d'une relation d'ordre. C. R. Acad. Sci. Paris 254 (1962), 1370-1371. MR 31 #87.
5. M. C. Golumbic, Comparability graphs and a new matroid. J. Combinatorial Theory B 22 (1977), 68-90.
6. M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York (1980).
7. D. Kelly, Comparability graphs, in Graphs and Order (I. Rival, ed.), D. Reidel Publishing Co., Holland (1985), 3-40.
8. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math. 2 (1972), 253-267.
9. R. H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Order (I. Rival, ed.), D. Reidel Publishing Co., Holland (1985), 41-101.