Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10509925" target="_blank" >RIV/00216208:11320/25:10509925 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.4230/LIPIcs.STACS.2025.16" target="_blank" >https://doi.org/10.4230/LIPIcs.STACS.2025.16</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2025.16" target="_blank" >10.4230/LIPIcs.STACS.2025.16</a>

Result language

angličtina

Original language name

Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges

Original language description

We prove that the spanning trees of any outerplanar triangulation G can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs G with faces of arbitrary lengths (not necessarily 3) we establish a similar result, with the condition that the two exchanged edges share an end vertex or lie on a common face. These listings of spanning trees are obtained from a simple greedy algorithm that can be implemented efficiently, i.e., in time O(n log n) per generated spanning tree, where n is the number of vertices of G. Furthermore, the listings correspond to Hamilton paths on the 0/1-polytope that is obtained as the convex hull of the characteristic vectors of all spanning trees of G.

Czech name

—

Czech description

—

Type

D - Article in proceedings

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/GA22-15272S" target="_blank" >GA22-15272S: Principles of combinatorial generation</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2025

Confidentiality

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

Article name in the collection

Leibniz International Proceedings in Informatics, LIPIcs

ISBN

978-3-95977-365-2

ISSN

1868-8969

e-ISSN

—

Number of pages

18

Pages from-to

16.1-16.18

Publisher name

Schloss Dagstuhl, Leibniz-Zentrum für Informatik

Place of publication

Wadern

Event location

Jena

Event date

Mar 4, 2025

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001532683200016