Arbres minimaux d'un graphe preordonne
type: Item
instance of: scholarly article
title: Arbres minimaux d'un graphe preordonne
zbMATH Open document ID: 0518.05024
DOI: 10.1016/0012-365X(83)90249-2
author: Claude Flament
author: Bruno Leclerc
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3819745
zbMATH Keywords: minimal spanning trees
zbMATH Keywords: quasi-ordered
zbMATH Keywords: strongly optimal trees
zbMATH Keywords: bases of matroids
zbMATH Keywords: dependence graphs
MaRDI profile type: Publication
cites work: Q5615282
cites work: Comments on bases in dependence structures
cites work: OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS
cites work: Q4096965
cites work: Hypergraphes arbores
cites work: Optimal assignments in an ordered set: An application of matroid theory
cites work: Q5592263
cites work: The dependence graph for bases in matroids
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4132566
cites work: Q4159081
cites work: Matroid basis graphs. II
cites work: Intervals in matroid basis graphs
cites work: Q5601351
cites work: Q4111952
description: scientific article; zbMATH DE number 3819745