Partitions of graphs into one or two independent sets and cliques

Discrete Mathematics

Volumn 152, Issue 1-3, 1996, Pages 47-54

  Brandstädt, Andreas ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Generalization of bipartite and split graphs; Partitions of graphs into independent sets and cliques; Polynomial time recognition

Indexed keywords

EID: 0040321449     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00296-U     Document Type: Article

References (6)

1. A. Brandstädt, Partitions of graphs into one or two independent sets and cliques, Forschungsergebnisse der FSU Jena, N/84/71, 1984, extended abstract in: Graphs, Hypergraphs and Applications, Proc. Conf. on Graph Theory, Eyba, DDR, October 1984 Band 73 (Teubner-Texte, Leipzig, 1984) 19-22.
2. S. Földes and P.L. Hammer, Split graphs, Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Comput. Baton Rouge, Louisiana (1977) 311-315.
3. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness (Freeman, New York, 1979).
4. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. (1976) 237-267.
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
6. P.L. Hammer and B. Simeone, The splittance of a graph, Combinatorica 1 (1981) 275-284.