Low-degree spanning trees of 2-edge-connected graphs in linear time

Dariusz Dereniowski (), Janusz Dybizbański, Przemysław Karpiński, Michał Zakrzewski and Paweł Żyliński
Additional contact information
Dariusz Dereniowski: Gdańsk University of Technology
Janusz Dybizbański: University of Gdansk
Przemysław Karpiński: Intel Technology Poland Ltd.
Michał Zakrzewski: University of Gdansk
Paweł Żyliński: University of Gdansk

Journal of Combinatorial Optimization, 2025, vol. 50, issue 4, No 5, 8 pages

Abstract: Abstract We present a simple linear-time algorithm that finds a spanning tree T of a given 2-edge-connected graph G such that each vertex v of T has degree at most $$\lceil \frac{\deg _G(v)}{2}\rceil + 1$$ .

Keywords: 2-Edge-connected graph; Computational complexity; Graph algorithms; Spanning tree (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01368-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:4:d:10.1007_s10878-025-01368-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01368-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().