On the maximum degree of path-pairable planar graphs
Combinatorics
2017-05-18 v1
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 -vertex path-pairable planar graph must contain a vertex of degree linear in .
Keywords
Cite
@article{arxiv.1705.06068,
title = {On the maximum degree of path-pairable planar graphs},
author = {António Girão and Gábor Mészáros and Kamil Popielarz and Richard Snyder},
journal= {arXiv preprint arXiv:1705.06068},
year = {2017}
}