Branchings in rooted graphs and the diameter of greedoids

DOI10.1007/BF02122803zbMath0669.05024MaRDI QIDQ1118604

Günter M. Ziegler

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

basis graph2- connected branching greedoid2-connected rooted graphgreeoidsmatroid exchange axiommaximum diameter

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Related Items (1)

Gray codes from antimatroids

Cites Work

• Structural properties of greedoids
• The theory of convex geometries
• Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
• Homotopy properties of greedoids
• On complements in lattices of finite length
• Polymatroid greedoids
• Greedoids and Linear Objective Functions
• Basis graphs of greedoids and two-connectivity
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Introduction to Greedoids

This page was built for publication: Branchings in rooted graphs and the diameter of greedoids