Paths with restricted degrees of their vertices in planar graphs

Title:

Paths with restricted degrees of their vertices in planar graphs

Creator:

Jendroĺ, Stanislav

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:cfb212a0-09ad-4527-ab12-a3e6eb48b74e
uuid:cfb212a0-09ad-4527-ab12-a3e6eb48b74e

Subject:

math and planar graphs

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

In this paper it is proved that every $3$-connected planar graph contains a path on $3$ vertices each of which is of degree at most $15$ and a path on $4$ vertices each of which has degree at most $23$. Analogous results are stated for $3$-connected planar graphs of minimum degree $4$ and $5$. Moreover, for every pair of integers $n\ge 3$, $ k\ge 4$ there is a $2$-connected planar graph such that every path on $n$ vertices in it has a vertex of degree $k$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

481-490

Source:

Czechoslovak Mathematical Journal | 1999 Volume:49 | Number:3

Harvested from:

CDK

Metadata only:

false