Two more characterizations of König-Egerváry graphs
From MaRDI portal
Publication:2403804
DOI10.1016/j.dam.2016.05.012zbMath1369.05162OpenAlexW2469309182MaRDI QIDQ2403804
Vadim E. Levit, Adi Jarden, Eugen Mandrescu
Publication date: 12 September 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.012
Extremal problems in graph theory (05C35) 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 (10)
MAXIMAL HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEMS ⋮ CRITICAL DUAL SET-SYSTEMS ⋮ THE MAXIMUM CARDINALITY OF A HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEM ⋮ Critical and maximum independent sets of a graph ⋮ The maximum number of maximum dissociation sets in trees ⋮ Combinatorial and spectral properties of König-Egerváry graphs ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ DUALITY AND HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEMS ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition ⋮ On an annihilation number conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- A set and collection lemma
- Polynomial time recognition of essential graphs having stability number equal to matching number
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- Ear-decompositions of matching-covered graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- Combinatorial properties of the family of maximum stable sets of a graph
- Critical and maximum independent sets of a graph
- On the number of vertices belonging to all maximum stable sets of a graph
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Critical independent sets and König-Egerváry graphs
- A note on coloring vertex-transitive graphs
- Forbidden subgraphs and the König-Egerváry property
- On maximum matchings in König-Egerváry graphs
- On some conjectures concerning critical independent sets of a graph
- On hitting all maximum cliques with an independent set
- Node-weighted graphs having the König-Egerváry property
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set
- A Theorem on k-Saturated Graphs
This page was built for publication: Two more characterizations of König-Egerváry graphs
