Win, Sein On a conjecture of Las Vergnas concerning certain spanning trees in graphs. (English) Zbl 0432.05035 Result. Math. 2, 215-224 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 ReviewsCited in 32 Documents MSC: 05C40 Connectivity Keywords:graphs; spanning trees; connectivity PDFBibTeX XMLCite \textit{S. Win}, Result. Math. 2, 215--224 (1979; Zbl 0432.05035) Full Text: DOI References: [1] V. Chvátal and P. Erdös, A note on hamiltonian circuits. Discrete Math. 2 (1972), 111–113. · Zbl 0233.05123 · doi:10.1016/0012-365X(72)90079-9 [2] F. Harary, Graph Theory. Addison-Wesley, Reading, Massuchetts, 1969. 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.