×

zbMATH — the first resource for mathematics

Edmonds polytopes and weakly Hamiltonian graphs. (English) Zbl 0267.05118

MSC:
05C35 Extremal problems in graph theory
15A39 Linear inequalities of matrices
52Bxx Polytopes and polyhedra
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] V. Chvátal, ”Tough graphs and hamiltonian circuits”,Discrete Mathematics 5 (1973), to appear. · Zbl 0256.05122
[2] V. Chvátal, ”Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 5 (1973) 305–337. · Zbl 0253.05131
[3] G. Dantzig, R. Fulkerson and S. Johnson, ”Solution of a large-scale traveling salesman problem”,Operations Research 2 (1954) 393–410.
[4] J. Edmonds, ”Maximum matching and a polyhedron with 0, 1-vertices”,Journal of Research of the National Bureau of Standards 69B (1965) 125–130. · Zbl 0141.21802
[5] F. Harary,Graph theory (Addison-Wesley, Reading, Mass., 1969). · Zbl 0182.57702
[6] D.E. Knuth,The art of computer programming, Vol. 1 (Addison-Wesley, Reading, Mass., 1969). · Zbl 0191.18001
[7] W.T. Tutte, ”The factors of graphs”,Canadian Journal of Mathematics 4 (1952) 314–328. · Zbl 0049.24202
[8] M.E. Watkins and D.M. Mesner, ”Cycles and connectivity in graphs”,Canadian Journal of Mathematics 19 (1967) 1319–1328. · Zbl 0205.28501
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.