A characterization of mixed branching greedoids

DOI10.1007/S00026-007-0307-0zbMATH Open1115.05015OpenAlexW2033249703MaRDI QIDQ880928FDOQ880928

Authors Steven J. Tedford

Publication date 21 May 2007

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-007-0307-0

zbMATH Keywords

forbidden minorrooted mixed graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Recommendations

• A characteristic polynomial for rooted mixed graphs
• A characterization of undirected branching greedoids
• A branching greedoid for multiply-rooted graphs and digraphs
• Minor characterization of undirected branching greedoids -- a short proof
• Greedoids and searches in directed graphs

Cited in

(5)

• A Tutte polynomial which distinguishes rooted unicyclic graphs
• Greedoids and searches in directed graphs
• scientific article; zbMATH DE number 6694565 (Why is no real title available?)
• A characterization of undirected branching greedoids
• On local maximum stable set greedoids

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

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