𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Short Proof of a Theorem of Reid and Parker on Tournaments

✍ Scribed by V. Neumann-Lara


Publisher
Springer Japan
Year
1994
Tongue
English
Weight
173 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Landau's inequalities for tournament sco
✍ Richard A. Brualdi; Jian Shen πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 106 KB

Ao and Hanson, and Guiduli, Gya Γ‚ rfa Γ‚ s, Thomasse Γ‚ and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Á Á Á s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an

A short proof of a theorem on Hamiltonia
✍ 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