Subgraphs with restricted degrees of their vertices in planar 3-connected graphs (Q1376060): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Stanlislav Jendroľ / rank | |||
Property / reviewed by | |||
Property / reviewed by: Stelian Mihalas / rank | |||
Property / author | |||
Property / author: Stanlislav Jendroľ / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Stelian Mihalas / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the total coloring of planar graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4013453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4117038 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4085741 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4027161 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths with restricted degrees of their vertices in planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A structural property of convex 3-polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strengthening of a theorem about 3-polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending Kotzig's theorem / rank | |||
Normal rank |
Latest revision as of 10:17, 28 May 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
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