Arbres minimaux d'un graphe preordonne

DOI10.1016/0012-365X(83)90249-2zbMath0518.05024MaRDI QIDQ1053701

Bruno Leclerc, Claude Flament

Publication date: 1983

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

zbMATH Keywords

dependence graphsminimal spanning treesbases of matroidsquasi-orderedstrongly optimal trees

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (2)

Finding socially best spanning treesî ⋮ A preference-based approach to spanning trees and shortest paths problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Intervals in matroid basis graphs
• The dependence graph for bases in matroids
• Hypergraphes arbores
• Matroid basis graphs. II
• OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS
• Comments on bases in dependence structures
• Optimal assignments in an ordered set: An application of matroid theory

This page was built for publication: Arbres minimaux d'un graphe preordonne