Pages that link to "Item:Q599828"
From MaRDI portal
The following pages link to A characterization of the graphs in which the transversal number equals the matching number (Q599828):
Displaying 50 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- Critical sets in bipartite graphs (Q368442) (← links)
- A set and collection lemma (Q405128) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- The critical independence number and an independence decomposition (Q616388) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- On the intersection of all critical sets of a unicyclic graph (Q741775) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Combinatorial properties of the family of maximum stable sets of a graph (Q1348387) (← links)
- Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- Problems on matchings and independent sets of a graph (Q1744740) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- Regular graphs with equal matching number and independence number (Q2074360) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- On the critical difference of almost bipartite graphs (Q2159389) (← links)
- Some more updates on an annihilation number conjecture: pros and cons (Q2164992) (← links)
- On transversal numbers of intersecting straight line systems and intersecting segment systems (Q2236577) (← links)
- Monotonic properties of collections of maximum independent sets of a graph (Q2314418) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
- On some conjectures concerning critical independent sets of a graph (Q2629485) (← links)
- The price of defense (Q2663706) (← links)
- Forbidden subgraphs and the Kőnig property (Q2840731) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- On transversal and 2-packing numbers in uniform linear systems (Q5154597) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- On critical difference, independence number and matching number of graphs (Q6133662) (← links)
