Previous |  Up |  Next

Article

Title: Minimum maximal graphs with forbidden subgraphs (English)
Author: Harary, Frank
Author: Plantholt, Michael
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 35
Issue: 1
Year: 1985
Pages: 83-89
.
Category: math
.
MSC: 05C35
idZBL: Zbl 0597.05039
idMR: MR783966
.
Date available: 2009-09-25T09:43:21Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/128710
.
Reference: [1] BOLLOBÁS B.: Extremal graph theory.Academic Press, London 1978. MR 0506522
Reference: [2] ERDÖS P.: Über ein Extremalproblem in der Graphentheorie.Archiv Math. 13, 1962, 222-227. Zbl 0105.17504, MR 0139542
Reference: [3] ERDÖS P., HAJNAL A., MOON J. W.: A problem in graph theory.Amer. Math. Monthly 71, 1964, 1107-1110. Zbl 0126.39401, MR 0170339
Reference: [4] HARARY F.: Graph theory.Addison-Wesley, Reading 1969. Zbl 0196.27202, MR 0256911
Reference: [5] HARARY F.: Maximum versus minimum invariants for graphs.J. Graph Theory 7, 1983, 275-284. Zbl 0515.05053, MR 0710904
Reference: [6] HARARY F., READ R. C.: Is the null graph a pointless concept?.Springer Lecture Notes Math. 406, 1974, 37-44. Zbl 0293.05101, MR 0360369
Reference: [7] MADER W.: 1-Faktoren von Graphen.Math. Ann. 201, 1973, 269-282. Zbl 0234.05115, MR 0360357
Reference: [8] MOON J. W.: An extremal problem in graph theory.Intern. Congress of Math., Moscow 1966, Abstracts, Section 13, 10.
Reference: [9] OLLMAN L. T.: K2.2-saturated graphs with a minimal number of edges.Proc. 3rd SE Conf. Combinatorics, Graph Theory and Computing, Florida Atlantic Univ., Boca Raton 1972, 367-392. MR 0349477
Reference: [10] SIMONOVITS M.: A method for solving extremal problems in graph theory, stability problems.Theory of Graphs (ed. P. Erdos and G. Katona), Academic Press, New York 1968, 279-319. Zbl 0164.24604, MR 0233735
Reference: [11] TURÁN P.: Eine Extremalaufgabe aus der Graphentheorie.Mat. Fiz. Lapok 48, 1941, 436-452 (in Hungarian). Zbl 0026.26903, MR 0018405
.

Files

Files Size Format View
MathSlov_35-1985-1_11.pdf 510.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo