𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum independent set problem for cubic planar graphs

✍ Scribed by James E. Burns

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
286 KB
Volume
19
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Genus Problem for Cubic Graphs
The Genus Problem for Cubic Graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 206 KB

We prove that the following problem is NP-complete: Given a cubic graph G and a natural number g, is it possible to draw G on the sphere with g handles added?

On the max-cut problem for a planar, cub
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24β€‰βˆ’β€‰7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example

The Cardinality of the Collection of Max
The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph
✍ Shu-Chu Chang; Yeong-Nan Yeh πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 226 KB

An independent set or stable set of a graph G V, E is a subset S of the Ε½ . vertices set V in which no two are adjacent. Let G be the number of vertices in Ε½ . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little