A characterization of undirected branching greedoids

DOI10.1016/0095-8956(88)90067-6zbMath0646.05016OpenAlexW2063861201MaRDI QIDQ1103626

Wolfgang Schmidt

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90067-6

zbMATH Keywords

treesexcluded minorsGreedoids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (7)

Weighted Rooted Trees: Fat or Tall? ⋮ Excluded-minor characterizations of antimatroids arisen from posets and graph searches. ⋮ The forbidden minor characterization of line-search antimatroids of rooted digraphs ⋮ New polyhedral and algorithmic results on greedoids ⋮ Greedoids and searches in directed graphs ⋮ Minor characterization of undirected branching greedoids -- a short proof ⋮ Unnamed Item

Cites Work

• Structural properties of greedoids
• Non-interval greedoids and the transposition property
• Polymatroid greedoids
• Matroids and Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of undirected branching greedoids