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
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
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.
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.