𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Three short proofs in graph theory

✍ Scribed by L Lovász

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
197 KB
Volume
19
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly orderable graphs are quasi-par
Perfectly orderable graphs are quasi-parity graphs: a short proof
✍ A. Hertz; D. de Werra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 287 KB

%'c shw that perfectly orderabk grapk Sa are q&-parity graphs by exhibiting two &lodes which are not llinked by a chordless odd chain. This proof is short and simpler than the one given by H. Meynid.

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

On convexity proofs in location theory
On convexity proofs in location theory
✍ Robert F. Love; James G. Morris 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

It is often assumed in the facility location literature that functions of the type +i(z, y) =p,{(zj-z)\*+ (yi-y)a]R/s are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given. DIFFERENTIABILITY Consi