Subgraphs with restricted degrees of their vertices in planar 3-connected graphs (Q1376060): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Stanlislav Jendroľ / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Stelian Mihalas / rank
 
Normal rank

Revision as of 10:49, 16 February 2024

scientific article
Language Label Description Also known as
English
Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
scientific article

    Statements

    Subgraphs with restricted degrees of their vertices in planar 3-connected graphs (English)
    0 references
    0 references
    0 references
    21 January 1998
    0 references
    Every 3-connected planar graph \(G\) either contains a path with \(k\) vertices each of degree at most \(5k\) or does not contain any path with \(k\) vertices; the bound \(5k\) is the best possible. Moreover, for every connected planar graph \(H\) other than a path and for every integer \(m\geq 3\) there is a 3-connected planar graph \(G\) such that each copy of \(H\) in \(G\) contains a vertex of degree at least \(m\).
    0 references
    planar graph
    0 references
    path
    0 references
    degree
    0 references

    Identifiers