Two more characterizations of König-Egerváry graphs
DOI10.1016/J.DAM.2016.05.012zbMATH Open1369.05162OpenAlexW2469309182MaRDI QIDQ2403804FDOQ2403804
Authors: Adi Jarden, Vadim E. Levit, 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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Ear-decompositions of matching-covered graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Title not available (Why is that?)
- Combinatorial properties of the family of maximum stable sets of a graph
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Critical independent sets and König-Egerváry graphs
- On maximum matchings in König-Egerváry graphs
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- A note on coloring vertex-transitive graphs
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- Node-weighted graphs having the König-Egerváry property
- On the number of vertices belonging to all maximum stable sets of a graph
- On hitting all maximum cliques with an independent set
- A set and collection lemma
- 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
- Polynomial time recognition of essential graphs having stability number equal to matching number
- Title not available (Why is that?)
- On some conjectures concerning critical independent sets of a graph
- Forbidden subgraphs and the König-Egerváry property
- Critical and maximum independent sets of a graph
Cited In (23)
- The maximum number of maximum dissociation sets in trees
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- When is \(G^2\) a König-Egerváry graph?
- Duality and hereditary König-Egerváry set-systems
- Combinatorial and spectral properties of König-Egerváry graphs
- On an annihilation number conjecture
- On König-Egerváry collections of maximum critical independent sets
- Matchings in graphs and groups
- On duality between local maximum stable sets of a graph and its line-graph
- Node-weighted graphs having the König-Egerváry property
- MAXIMAL HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEMS
- A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
- Critical and maximum independent sets of a graph
- König-Egerváry graphs are non-Edmonds
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
- CRITICAL DUAL SET-SYSTEMS
- Some good characterization results relating to the Kőnig-Egerváry theorem
- Monotonic properties of collections of maximum independent sets of a graph
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- Coverings, matchings and the number of maximal independent sets of graphs
- A characterization of König-Egerváry graphs with extendable vertex covers
- THE MAXIMUM CARDINALITY OF A HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEM
- Jacobi's identity and the König-Egerváry theorem
This page was built for publication: Two more characterizations of König-Egerváry graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403804)
