Edge-partitioning 3-edge-connected graphs into paths
Combinatorics
2019-07-29 v1
Abstract
We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number of edges is divisible by l). This improves a result asserting that 24-edge-connectivity and high minimum degree provides such a partition. This is best possible as 3-edge-connectivity cannot be replaced by 2-edge connectivity.
Keywords
Cite
@article{arxiv.1907.11600,
title = {Edge-partitioning 3-edge-connected graphs into paths},
author = {Tereza Klimošová and Stéphan Thomassé},
journal= {arXiv preprint arXiv:1907.11600},
year = {2019}
}
Comments
41 pages, 4 figures