Minimum spanning tree cycle intersection problem

DOI10.1016/j.dam.2021.01.031zbMath1464.05038arXiv2102.13193OpenAlexW3129739404MaRDI QIDQ2656964

César Massri, Gabriel Taubin, Manuel Dubinsky

Publication date: 17 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.13193

zbMATH Keywords

cycle basesspanning trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (3)

Proof of a conjecture about minimum spanning tree cycle intersection ⋮ Cycle intersection in spanning trees: a shorter proof of a conjecture and applications ⋮ Minimum spanning tree cycle intersection problem on outerplanar graphs

Uses Software

• nauty
• Traces

Cites Work

• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Classes of cycle bases
• Atom-bond connectivity index of trees
• Minimum cycle bases for network graphs
• Practical graph isomorphism. II.
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Algorithms for Generating Fundamental Cycles in a Graph
• Lectures on matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum spanning tree cycle intersection problem