Arbres minimaux d'un graphe preordonne

DOI10.1016/0012-365X(83)90249-2zbMATH Open0518.05024MaRDI QIDQ1053701FDOQ1053701

Authors: Claude Flament, Bruno Leclerc 

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)

Cites Work

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

Cited In (2)

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

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

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