On Path-Pairability of Cartesian Product of Complete Bipartite Graphs
Combinatorics
2016-10-31 v3
Abstract
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, depending on the size of the Cartesian product. We present path-pairable graph families, that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented.
Keywords
Cite
@article{arxiv.1401.7929,
title = {On Path-Pairability of Cartesian Product of Complete Bipartite Graphs},
author = {Gabor Meszaros},
journal= {arXiv preprint arXiv:1401.7929},
year = {2016}
}