✦ LIBER ✦

A short proof of a theorem on Hamiltonian graphs

✍ Scribed by Ainouche, A.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 219 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

A short proof of K�nig's matching theore

A short proof of K�nig's matching theorem

✍ Rizzi, Romeo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB 👁 1 views

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

A short proof of Kuratowski's graph plan

A short proof of Kuratowski's graph planarity criterion

✍ Makarychev, Yury 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 1 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

A quick proof of Riemann's mapping theor

A quick proof of Riemann's mapping theorem

✍ H. P. McKean 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB 👁 1 views

A new proof of the Caffarelli-Kohn-Niren

A new proof of the Caffarelli-Kohn-Nirenberg theorem

✍ Fanghua Lin 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

Here we give a self-contained new proof of the partial regularity theorems for solutions of incompressible Navier-Stokes equations in three spatial dimensions. These results were originally due to Scheffer and Caffarelli, Kohn, and Nirenberg. Our proof is much more direct and simpler.