Two more characterizations of König-Egerváry graphs
From MaRDI portal
(Redirected from Publication:2403804)
Recommendations
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 5037208 (Why is no real title available?)
- A Theorem on k-Saturated Graphs
- A characterization of the graphs in which the transversal number equals the matching number
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- A note on coloring vertex-transitive graphs
- A note on hitting maximum and maximal cliques with a stable set
- A set and collection lemma
- Combinatorial properties of the family of maximum stable sets of a graph
- Critical and maximum independent sets of a graph
- Critical independent sets and König-Egerváry graphs
- Ear-decompositions of matching-covered graphs
- Forbidden subgraphs and the König-Egerváry property
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Node-weighted graphs having the König-Egerváry property
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- On hitting all maximum cliques with an independent set
- On maximum matchings in König-Egerváry graphs
- On some conjectures concerning critical independent sets of a graph
- On the number of vertices belonging to all maximum stable sets of a graph
- Polynomial time recognition of essential graphs having stability number equal to matching number
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- The critical independence number and an independence decomposition
Cited in
(24)- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- The maximum number of maximum dissociation sets in trees
- When is \(G^2\) a König-Egerváry graph?
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Combinatorial and spectral properties of König-Egerváry graphs
- Duality and hereditary König-Egerváry set-systems
- 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
- A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
- MAXIMAL HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEMS
- 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
- Some good characterization results relating to the Kőnig-Egerváry theorem
- CRITICAL DUAL SET-SYSTEMS
- Monotonic properties of collections of maximum independent sets of a graph
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- A characterization of König-Egerváry graphs with extendable vertex covers
- Coverings, matchings and the number of maximal independent sets of graphs
- 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)
