scientific article
From MaRDI portal
Publication:2752151
zbMath0979.05085arXivmath/0011156MaRDI QIDQ2752151
Eugen Mandrescu, Vadim E. Levit
Publication date: 17 February 2002
Full work available at URL: https://arxiv.org/abs/math/0011156
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
On unicyclic graphs with uniquely restricted maximum matchings ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On local maximum stable set greedoids ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Graph operations that are good for greedoids ⋮ The Clique Corona Operation and Greedoids
This page was built for publication:
