Edge-partitioning 3-edge-connected graphs into paths

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10455871" target="_blank" >RIV/00216208:11320/22:10455871 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=TC0IQ-x5T7" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=TC0IQ-x5T7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2022.05.001" target="_blank" >10.1016/j.jctb.2022.05.001</a>

Result language
angličtina
Original language name
Edge-partitioning 3-edge-connected graphs into paths
Original language description
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.(c) 2022 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)