✦ LIBER ✦

A constructive proof of Vizing's theorem

✍ Scribed by J. Misra; David Gries

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 244 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90041-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Constructive Proof of Gleason's Theore

A Constructive Proof of Gleason's Theorem

✍ Fred Richman; Douglas Bridges 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Gleason's theorem states that any totally additive measure on the closed subspaces, or projections, of a Hilbert space of dimension greater than two is given by a positive operator of trace class. In this paper we give a constructive proof of that theorem.

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 constructive topological proof of van

A constructive topological proof of van der Waerden's theorem

✍ Thierry Coquand 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 670 KB

A constructive proof of the Peter-Weyl t

A constructive proof of the Peter-Weyl theorem

✍ Thierry Coquand; Bas Spitters 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

We present a new and constructive proof of the Peter-Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C\*-algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the cha

A Constructive Proof of a Theorem in Rel

A Constructive Proof of a Theorem in Relevance Logic

✍ Aleksandar Kron 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 1 views

In this paper we investigate a propositional systeni L related t o T,-W of relevance logic. It has been conjectured that for any formulas A and B

An extension of Vizing's theorem

✍ Chew, K. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

Let G = (V (G), E(G)) be a simple graph of maximum degree ∆ ≤ D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) ∪ E(G) such that no adjacent or incident elements of S receive