Maximum induced forests of planar graphs (Q1107540): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Path chromatic numbers of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large induced degenerate subgraphs / rank | |||
Normal rank | |||
Revision as of 17:38, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum induced forests of planar graphs |
scientific article |
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
