×

A method in graph theory. (English) Zbl 0331.05138


MSC:

05C99 Graph theory
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Berge, C., Graphs and hypergraphs, (1973), North-Holland Amsterdam · Zbl 0483.05029
[2] Boesch, I.T.; Cher, S.; McHugh, J.A.M., On covering the points of a graph with point disjoint paths, ()
[3] Bondy, J.A., Properties of graphs with constraints on degrees, Studia sci. math. hungar., 4, 473-475, (1969) · Zbl 0184.27702
[4] Chartrand, G.; Kapoor, S.F.; Lick, D.R., N-Hamiltonian graphs, J. combin. theory, 9, 308-312, (1970) · Zbl 0204.57005
[5] Chvátal, V., On Hamilton’s ideals, J. combin. theory, 12, 163-168, (1972) · Zbl 0213.50803
[6] E.J. Cockayne and P.J. Lorimer, The Ramsey graph number for stripes, Report Series 37, Dept. Math., Univ. Auckland, Auckland. · Zbl 0318.05109
[7] Dirac, G.A., Some theorems on abstract graphs, Proc. London math. soc., 2, 68-81, (1952) · Zbl 0047.17001
[8] Grünbaum, B., Convex polytopes, (1967), Wiley-Interscience New York, see Chapter 17 (written by V. Klee). · Zbl 0163.16603
[9] Harary, F., Graph theory, (1969), Addison-Wesley Reading, Mass · Zbl 0797.05064
[10] Hašek, J., The good soldier schweik, (1951), Penguin Books Harmondsworth
[11] Kronk, H.V., Variations on a theorem of Pósa, (), 193-197 · Zbl 0187.21104
[12] Las Vergnas, M., Sur une proprieté des arbres maximaux dans un graphe, C.R. acad. sci. Paris, 272, 1297-1300, (1971) · Zbl 0221.05053
[13] Las Vergnas, M., Thesis, VI, (1972), L’Université de Paris
[14] Ore, O., Note on Hamilton circuits, Am. math. monthly, 67, 55, (1960) · Zbl 0089.39505
[15] Pósa, L., A theorem concerning Hamiltonian lines, Magyar tud. akad. mat. kutató inst. Közl., 7, 225-226, (1962) · Zbl 0114.40003
[16] Ramsey, F.P., On a problem of formal logic, Proc. London math. soc., 30, 264-286, (1930) · JFM 55.0032.04
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.