Some Extremal Properties of Bipartite Subgraphs
Canadian journal of mathematics, Tome 25 (1973) no. 3, pp. 475-485
Voir la notice de l'article provenant de la source Cambridge University Press
Gp = (V, X) is a graph on p vertices, with vertex set V and edge set X. Occasionally, to avoid ambiguity, V and X will be written V(GP) and X(GP), respectively.
Edwards, C. S. Some Extremal Properties of Bipartite Subgraphs. Canadian journal of mathematics, Tome 25 (1973) no. 3, pp. 475-485. doi: 10.4153/CJM-1973-048-x
@article{10_4153_CJM_1973_048_x,
author = {Edwards, C. S.},
title = {Some {Extremal} {Properties} of {Bipartite} {Subgraphs}},
journal = {Canadian journal of mathematics},
pages = {475--485},
year = {1973},
volume = {25},
number = {3},
doi = {10.4153/CJM-1973-048-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-048-x/}
}
[1] 1. Harary, F., Graph Theory (Addison-Wesley, Reading, 1969). Google Scholar
[2] 2. Turan, P., Eine Extremalaufgabe aus der Graphentheorie, Mat. Lapok 48 (1941), 436–452. Google Scholar
Cité par Sources :