The connectivity of the basis graph of a branching greedoid

DOI10.1002/jgt.3190160306zbMath0765.05062OpenAlexW2110824058MaRDI QIDQ4013425

Xue Liang Li, Hajo J. 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

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)

Related Items (5)

Cycles in circuit graphs of matroids ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ Hamilton cycles in circuit graphs of matroids ⋮ Paths in circuit graphs of matroids ⋮ The connectivity and minimum degree of circuit graphs of matroids

Cites Work

• Basis graphs of greedoids and two-connectivity

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