✦ LIBER ✦

A simpler proof and a generalization of the zero-trees theorem

✍ Scribed by A Schrijver; P.D Seymour

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 290 KB
Volume: 58
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(91)90063-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simpler proof of a theorem of Steinmet

A simpler proof of a theorem of Steinmetz

✍ Fred Gross; Charles F Osgood 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Simpler proof of a realizability theorem

Simpler proof of a realizability theorem on Delaunay triangulations

✍ Kokichi Sugihara 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A Simpler Proof of the Excluded Minor Th

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t

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

A proof of the Markov chain tree theorem

✍ V. Anantharam; P. Tsoucas 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 340 KB

A generalization of Ramsey's theorem for

A generalization of Ramsey's theorem for regular trees

✍ Walter Deuber 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 331 KB