Maximum induced forests of planar graphs (Q1107540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum induced forests of planar graphs |
scientific article; zbMATH DE number 4065012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum induced forests of planar graphs |
scientific article; zbMATH DE number 4065012 |
Statements
Maximum induced forests of planar graphs (English)
0 references
1987
0 references
We propose following two conjectures: 1) If G is a planar graph of order \(n\geq 4\), then there exist \(\lceil \frac{n}{2}\rceil\) vertices in G which induce a forest. 2) If G is a planar graph of order n, then it has a stable set with \(\lceil \frac{n}{4}\rceil\) vertices.
0 references
planar graph
0 references
forest
0 references
stable set
0 references
0 references
0.94195384
0 references
0.94126964
0 references
0.9399795
0 references
0 references
0.93221575
0 references
0.92991287
0 references
0.92972374
0 references
0 references
