On König-Egerváry collections of maximum critical independent sets
From MaRDI portal
Publication:5198028
DOI10.26493/2590-9770.1261.9a0zbMath1421.05071arXiv1512.01994OpenAlexW2962938921MaRDI QIDQ5198028
Eugen Mandrescu, Vadim E. Levit
Publication date: 2 October 2019
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.01994
Combinatorial inequalities (05A20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
New results relating independence and matchings ⋮ CRITICAL DUAL SET-SYSTEMS ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ On an annihilation number conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- A set and collection lemma
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- On the intersection of all critical sets of a unicyclic graph
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Combinatorial properties of the family of maximum stable sets of a graph
- Critical and maximum independent sets of a graph
- Problems on matchings and independent sets of a graph
- On the number of vertices belonging to all maximum stable sets of a graph
- A new greedoid: The family of local maximum stable sets of a forest
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Critical independent sets and König-Egerváry graphs
- Monotonic properties of collections of maximum independent sets of a graph
- Two more characterizations of König-Egerváry graphs
- Forbidden subgraphs and the König-Egerváry property
- On maximum matchings in König-Egerváry graphs
- Using critical sets to solve the maximum independent set problem
- On some conjectures concerning critical independent sets of a graph
- Vertices Belonging to All Critical Sets of a Graph
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- Vertex packings: Structural properties and algorithms
This page was built for publication: On König-Egerváry collections of maximum critical independent sets
