𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of a theorem about the circumference of a graph

✍ Scribed by Tian Feng

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
125 KB
Volume
45
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ Ainouche, A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A short proof of a theorem of dirac's ab
A short proof of a theorem of dirac's about hadwiger's conjecture
✍ D. R. Woodall πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 1 views

## Abstract A Short proof is given of the theorem that every grph that does not have __K__~4~ as a subcontraction is properly vertex 3‐colorable.

A short proof of the Chen-Manalastas the
A short proof of the Chen-Manalastas theorem
✍ J.A. Bondy πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 232 KB

Gallai and Milgram (1960) proved that a digraph with stability number ct is spanned by ct disjoint directed paths. Chen and Manalastas Jr (1983) proved that a strong digraph with stability number at most two is spanned by at most two consistent directed circuits. We slightly simplify the proof of