The connectivity of the basis graph of a branching greedoid

DOI10.1002/JGT.3190160306zbMATH Open0765.05062OpenAlexW2110824058MaRDI QIDQ4013425FDOQ4013425

Xueliang Li, Hajo Broersma

Publication date: 27 September 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/the-connectivity-of-the-basis-graph-of-a-branching-greedoid(8553f315-0c74-4b09-80be-39f5c58410a4).html

Recommendations

• Basis graphs of greedoids and two-connectivity
• Branchings in rooted graphs and the diameter of greedoids
• scientific article
• The \(g\)-component connectivity of graphs
• A branching greedoid for multiply-rooted graphs and digraphs
• The \(e\)-exchange basis graph and matroid connectedness
• On the \(d\)-dimensional algebraic connectivity of graphs
• On connectivities of tree graphs
• The connectivity of hypergraphs
• Graph connectivity and binomial edge ideals

zbMATH Keywords

connectivity\(k\)-connected graphout-treesbasis graphminimum in-degreebranching greedoidrooted directed multigraph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Basis graphs of greedoids and two-connectivity

Cited In (9)

• Paths in circuit graphs of matroids
• The connectivity and minimum degree of circuit graphs of matroids
• Cycles in circuit graphs of matroids
• Hamilton cycles in circuit graphs of matroids
• Branchings in rooted graphs and the diameter of greedoids
• Connectivity of the lifts of a greedoid
• Basis graphs of greedoids and two-connectivity
• Greedoids and searches in directed graphs
• Properties of Hamilton cycles of circuit graphs of matroids

This page was built for publication: The connectivity of the basis graph of a branching greedoid

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