A characterization of the graphs in which the transversal number equals the matching number
From MaRDI portal
Publication:599828
DOI10.1016/0095-8956(79)90085-6zbMath0415.05032OpenAlexW1970607766MaRDI QIDQ599828
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90085-6
Related Items
On some conjectures concerning critical independent sets of a graph ⋮ Combinatorial properties of the family of maximum stable sets of a graph ⋮ On graphs admitting two disjoint maximum independent sets ⋮ Critical sets, crowns and local maximum independent sets ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ Stabilizing Network Bargaining Games by Blocking Players ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ On the critical difference of almost bipartite graphs ⋮ Hall's and Kőnig's theorem in graphs and hypergraphs ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ On approximability of optimization problems related to red/blue-split graphs ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ Two more characterizations of König-Egerváry graphs ⋮ Critical sets in bipartite graphs ⋮ Critical and maximum independent sets of a graph ⋮ The price of defense ⋮ König-Egerváry graphs are non-Edmonds ⋮ On the König graphs for a 5-path and its spanning supergraphs ⋮ Critical independent sets and König-Egerváry graphs ⋮ The critical independence number and an independence decomposition ⋮ The maximum number of maximum dissociation sets in trees ⋮ A set and collection lemma ⋮ Finding small stabilizers for unstable graphs ⋮ On critical difference, independence number and matching number of graphs ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Forbidden subgraphs and the König-Egerváry property ⋮ On maximum matchings in König-Egerváry graphs ⋮ The complexity of König subgraph problems and above-guarantee vertex cover ⋮ On local maximum stable set greedoids ⋮ The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Polynomial time recognition of essential graphs having stability number equal to matching number ⋮ On transversal numbers of intersecting straight line systems and intersecting segment systems ⋮ A characterization of Konig-Egervary graphs using a common property of all maximum matchings ⋮ On transversal and 2-packing numbers in uniform linear systems ⋮ Problems on matchings and independent sets of a graph ⋮ Combinatorial and spectral properties of König-Egerváry graphs ⋮ On \(\alpha\)-critical edges in König--Egerváry graphs ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ Graph Stabilization: A Survey ⋮ Stabilizing network bargaining games by blocking players ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ König Graphs with Respect to the 4-Path and Its Spanning Supergraphs ⋮ An improved approximation for maximum \(k\)-dependent set on bipartite graphs ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition ⋮ Monotonic properties of collections of maximum independent sets of a graph ⋮ König-Egerváry graphs, 2-bicritical graphs and fractional matchings ⋮ Regular graphs with equal matching number and independence number ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph ⋮ Forbidden subgraphs and the Kőnig property ⋮ Tractability of König edge deletion problems ⋮ Ear-decompositions of matching-covered graphs ⋮ On partial descriptions of König graphs for odd paths and all their spanning supergraphs
Cites Work
