For every l there exists d_l such that every 3-edge-connected graph with minimum degree at least d_l admits an edge-partition into paths of length l when the edge count is divisible by l.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Edge-partitioning 3-edge-connected graphs into paths
For every l there exists d_l such that every 3-edge-connected graph with minimum degree at least d_l admits an edge-partition into paths of length l when the edge count is divisible by l.