Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.37236/7291 | ELECTRONIC JOURNAL OF COMBINATORICS |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Degree (graph theory),Mathematics,Planar graph | Journal | 26 |
Issue | ISSN | Citations |
2 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| António Girão | 1 | 1 | 3.07 |
| Gábor Mészáros | 2 | 0 | 0.34 |
| Kamil Popielarz | 3 | 1 | 1.79 |
| Richard Snyder | 4 | 1 | 1.04 |