Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Basis graphs of greedoids and two-connectivity

From MaRDI portal
Publication:3716815
Jump to:navigation, search

DOI10.1007/BFb0121049zbMath0588.90063MaRDI QIDQ3716815

Bernhard Korte

Publication date: 1985

Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)


zbMATH Keywords

matroidsGreedoidsPivoting2-connected greedoid


Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)


Related Items (6)

Homotopy properties of greedoids ⋮ Branchings in rooted graphs and the diameter of greedoids ⋮ The connectivity of the basis graph of a branching greedoid ⋮ Greedoids and searches in directed graphs ⋮ Interpolation theorems for graphs, hypergraphs and matroids ⋮ Gray codes from antimatroids






This page was built for publication: Basis graphs of greedoids and two-connectivity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3716815&oldid=17215577"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 09:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki