Bicliques in graphs I: Bounds on their number

Combinatorica

Volumn 20, Issue 1, 2000, Pages 109-117

  Prisner, Erich ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034366497     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070035     Document Type: Article

References (13)

1. E. BALAS, C.S. YU: On graphs with polynomially solvable maximum-weight clique problem, Networks, 19 (1989), 247-253.
2. B. BOLLOBÁS, C. NARA, S. TACHIBANA: The maximal number of induced complete bipartite graphs, Discrete Math., 62 (1986), 271-275.
3. H.-J. BROERSMA, C. HOEDE: Path graphs, J. Graph Theory, 13 (1989), 427-444.
4. M. GAREY, D. S. JOHNSON: Computers and Intractability, W. H. Freeman & Co., New York 1979.
5. F. HARARY, J. A. KABELL, F. R. MCMORRIS: Bipartite intersection graphs, Comm. Math. Univ. Carolinae, 23 (1982), 735-745.
6. 3-graphs, J. Graph Theory, 21 (1996), 81-85.
7. T. MCKEE: A survey of connection graphs, in: Graph theory, combinatorics, algorithms and applications, Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, New York, NY, Wiley 767-776, 1995.
8. J. W. MOON, L. MOSER: On cliques in graphs, Israel J. Math., 3 (1965), 23-28.
9. H. MÜLLER: Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Applied Math., 78 (1997), 189-205.
10. E. PRISNER: Graphs with few cliques, in: Graph theory, combinatorics, algorithms and applications, Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, New York, NY, Wiley (1995) 945-956.
11. E. PRISNER: Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs, Proceedings of WG97, LNCS 1335 (1997) 273-287.
12. E. PRISNER: The recognition problem for line bigraphs, preprint 1999.
13. J. L. VILLAR: The underlying graph of a line digraph, Discrete Applied Math., 37/38 (1992), 525-538.