Minimum Spanning Tree Cycle Intersection Problem
Discrete Mathematics
2024-04-23 v2 Combinatorics
Abstract
Consider a connected graph and let be a spanning tree of . Every edge induces a cycle in . The intersection of two distinct such cycles is the set of edges of that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.
Cite
@article{arxiv.2102.13193,
title = {Minimum Spanning Tree Cycle Intersection Problem},
author = {Manuel Dubinsky and César Massri and Gabriel Taubin},
journal= {arXiv preprint arXiv:2102.13193},
year = {2024}
}