Proof of a conjecture about minimum spanning tree cycle intersection

DOI10.1016/J.DAM.2022.06.030MaRDI QIDQ2172386zbMATH OpenOpenAlexWikidataFDO

Authors Min-Jen Chen, Kun-Mao Chao

Publication date 15 September 2022

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

Full work available at URL https://doi.org/10.1016/j.dam.2022.06.030

zbMATH Keywords

cyclespanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Minimum spanning tree cycle intersection problem
• Subtree and substar intersection numbers
• On the tree graph of a connected graph
• On a tree graph defined by a set of cycles
• scientific article; zbMATH DE number 4112610

Cites work

• Minimum spanning tree cycle intersection problem
• On the History of the Minimum Spanning Tree Problem
• Optimum Communication Spanning Trees
• Spanning Trees and Optimization Problems
• The complexity of the network design problem

Cited in

(3)

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

This page was built for publication: Proof of a conjecture about minimum spanning tree cycle intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172386)