A characterization of undirected branching greedoids

DOI10.1016/0095-8956(88)90067-6MaRDI QIDQ1103626zbMATH OpenOpenAlexFDO

Authors 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

excluded minorsGreedoidstrees

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

Greedoids may be considered as a generalization of matroid theory. In the latter many properties are characterized by excluded minors. Here a class of greedoids, defined by trees of a graph rooted at a fixed vertex, are characterized as interval greedoids not containing four given minors.

Recommendations

• Minor characterization of undirected branching greedoids -- a short proof
• scientific article; zbMATH DE number 4093481
• A branching greedoid for multiply-rooted graphs and digraphs
• A characterization of mixed branching greedoids
• Greedoids and searches in directed graphs

Cites work

• scientific article; zbMATH DE number 3871387 (Why is no real title available?)
• scientific article; zbMATH DE number 3880732 (Why is no real title available?)
• scientific article; zbMATH DE number 4045761 (Why is no real title available?)
• scientific article; zbMATH DE number 3742601 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Matroids and Graphs
• Non-interval greedoids and the transposition property
• Polymatroid greedoids
• Structural properties of greedoids

Cited in

(11)

• Greedoids and searches in directed graphs
• On paths of greedoids and a minor characterization
• Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
• The forbidden minor characterization of line-search antimatroids of rooted digraphs
• Minor characterization of undirected branching greedoids -- a short proof
• New polyhedral and algorithmic results on greedoids
• scientific article; zbMATH DE number 6694565 (Why is no real title available?)
• Weighted Rooted Trees: Fat or Tall?
• scientific article; zbMATH DE number 2230309 (Why is no real title available?)
• A branching greedoid for multiply-rooted graphs and digraphs
• A characterization of mixed branching greedoids

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

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