On the maximum degree of path-pairable planar graphs (Q2415080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7056825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum degree of path-pairable planar graphs |
scientific article; zbMATH DE number 7056825 |
Statements
On the maximum degree of path-pairable planar graphs (English)
0 references
20 May 2019
0 references
Summary: A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any \(n\)-vertex path-pairable planar graph must contain a vertex of degree linear in \(n\). Our result generalizes to graphs embeddable on a surface of finite genus.
0 references
0.829907238483429
0 references
0.8274062275886536
0 references
0.8158907294273376
0 references
