The connectivity of the basis graph of a branching greedoid
From MaRDI portal
Publication:4013425
DOI10.1002/JGT.3190160306zbMATH Open0765.05062OpenAlexW2110824058MaRDI QIDQ4013425FDOQ4013425
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
connectivity\(k\)-connected graphout-treesbasis graphminimum in-degreebranching greedoidrooted directed multigraph
Cites Work
Cited In (7)
- 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
- Greedoids and searches in directed graphs
- Properties of Hamilton cycles of circuit graphs of matroids
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On connectivities of tree graphs π π
- A branching greedoid for multiply-rooted graphs and digraphs π π
- On the \(d\)-dimensional algebraic connectivity of graphs π π
- Branchings in rooted graphs and the diameter of greedoids π π
- The \(g\)-component connectivity of graphs π π
- The \(e\)-exchange basis graph and matroid connectedness π π
- Basis graphs of greedoids and two-connectivity π π
- Graph connectivity and binomial edge ideals π π
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)