𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independent sets and repeated degrees

✍ Scribed by B. Bollobás; A.D. Scott


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
316 KB
Volume
170
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Supereulerian graphs, independent sets,
✍ Zhi-Hong Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 573 KB

A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for every even subset R C V(G), there is a spanning connected subgraph of G whose set of odd degree vertices is R. The graph K1 is regarded as a trivial collapsible graph. A graph is reduced if it contains n

Lower bounds for constant degree indepen
✍ Michael O. Albertson; Debra L. Boutin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Let c(\* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(\* for graphs that are planar, maximal planar, of bounded degree, or trees.

DEGREES OF ANALYTIC SETS
✍ Karel Hrbacek 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 564 KB
The Degrees of Hyperimmune Sets
✍ Webb Miller; D. A. Martin 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

THE DEGREES OF HYPERIMMUNE SETS by WEBB MILLER in Walla Walla, Wash. (U.S.A.), and D. A. MARTIN in Cambridge, Mass. (U.S.A.