✦ LIBER ✦

A short proof of a theorem of M. Hashimoto

✍ Scribed by Joel Roberts; Jerzy Weyman

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 609 KB
Volume: 134
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(90)90215-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A short proof of the 3d distance theorem

✍ Frank M. Liang 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Proof, There are d arithmdztic sequence8 inserted (mod 1) into [O, I], In the following, we will refer to the 'Mart" and "flni~h" points of each of the sequences, These are, respectively, the points {q) and {(q -I)@ t cu,) for 1 G i G d. The idea of the proof is to associate each interval in [O, I]

A short proof of Chvátal's Watchman Theo

A short proof of Chvátal's Watchman Theorem

✍ Steve Fisk 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 45 KB

A very short proof of Dixon's theorem

✍ Shalosh B Ekhad 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 56 KB

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 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

A short proof for a generalization of Vi

A short proof for a generalization of Vizing's theorem

✍ Claude Berge; Jean Claude Fournier 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re