A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede R, Cai N, Zhang Z (1990)
In: Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel. Bodendiek R, Henn R (Eds); Heidelberg: Physica-Verl.: 37-39.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
Autor*in
Ahlswede, RudolfUniBi;
Cai, Ning;
Zhang, Zhen
Herausgeber*in
Bodendiek, Rainer;
Henn, Rudolf
Einrichtung
Erscheinungsjahr
1990
Buchtitel
Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel
Seite(n)
37-39
ISBN
3-7908-0439-8
Page URI
https://pub.uni-bielefeld.de/record/1780506
Zitieren
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In: Bodendiek R, Henn R, eds. Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel. Heidelberg: Physica-Verl.; 1990: 37-39.
Ahlswede, R., Cai, N., & Zhang, Z. (1990). A recursive bound for the number of complete K-subgraphs of a graph. In R. Bodendiek & R. Henn (Eds.), Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel (pp. 37-39). Heidelberg: Physica-Verl.
Ahlswede, Rudolf, Cai, Ning, and Zhang, Zhen. 1990. “A recursive bound for the number of complete K-subgraphs of a graph”. In Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel, ed. Rainer Bodendiek and Rudolf Henn, 37-39. Heidelberg: Physica-Verl.
Ahlswede, R., Cai, N., and Zhang, Z. (1990). “A recursive bound for the number of complete K-subgraphs of a graph” in Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel, Bodendiek, R., and Henn, R. eds. (Heidelberg: Physica-Verl.), 37-39.
Ahlswede, R., Cai, N., & Zhang, Z., 1990. A recursive bound for the number of complete K-subgraphs of a graph. In R. Bodendiek & R. Henn, eds. Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel. Heidelberg: Physica-Verl., pp. 37-39.
R. Ahlswede, N. Cai, and Z. Zhang, “A recursive bound for the number of complete K-subgraphs of a graph”, Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel, R. Bodendiek and R. Henn, eds., Heidelberg: Physica-Verl., 1990, pp.37-39.
Ahlswede, R., Cai, N., Zhang, Z.: A recursive bound for the number of complete K-subgraphs of a graph. In: Bodendiek, R. and Henn, R. (eds.) Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel. p. 37-39. Physica-Verl., Heidelberg (1990).
Ahlswede, Rudolf, Cai, Ning, and Zhang, Zhen. “A recursive bound for the number of complete K-subgraphs of a graph”. Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel. Ed. Rainer Bodendiek and Rudolf Henn. Heidelberg: Physica-Verl., 1990. 37-39.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
Dieses Objekt ist durch das Urheberrecht und/oder verwandte Schutzrechte geschützt. [...]
Volltext(e)
Name
Access Level
Open Access
Zuletzt Hochgeladen
2019-09-06T08:48:33Z
MD5 Prüfsumme
29710372fe95f01269832b1fc662c167
Google Scholar
ISBN Suche