Maximum induced forests of planar graphs (Q1107540): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:13, 5 March 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references