𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounded-Degree Independent Sets in Planar Graphs

✍ Scribed by Therese Biedl; Dana F. Wilkinson

Publisher
Springer
Year
2005
Tongue
English
Weight
425 KB
Volume
38
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Supereulerian graphs, independent sets,
Supereulerian graphs, independent sets, and degree-sum conditions
✍ 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
Lower bounds for constant degree independent sets
✍ 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.