The forbidden minor characterization of line-search antimatroids of rooted digraphs

DOI10.1016/S0166-218X(02)00471-7zbMath1022.05011DBLPjournals/dam/OkamotoN03OpenAlexW1970981351WikidataQ56502742 ScholiaQ56502742MaRDI QIDQ1410699

Yoshio Okamoto, Masataka Nakamura

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00471-7

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Excluded-minor characterizations of antimatroids arisen from posets and graph searches. ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ Characterizations of the convex geometries arising from the double shellings of posets

Cites Work

• Graph minors. XX: Wagner's conjecture
• Greedoids
• A characterization of undirected branching greedoids
• Meet-distributive lattices and the anti-exchange closure
• A labeling algorithm to recognize a line digraph and output its root graph
• Minor characterization of undirected branching greedoids -- a short proof
• Polymatroid greedoids
• An algorithmic characterization of antimatroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The forbidden minor characterization of line-search antimatroids of rooted digraphs