Pages that link to "Item:Q1348387"

The following pages link to Combinatorial properties of the family of maximum stable sets of a graph (Q1348387):

Displaying 21 items.

• Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
• Critical sets in bipartite graphs (Q368442) (← links)
• A set and collection lemma (Q405128) (← links)
• On the intersection of all critical sets of a unicyclic graph (Q741775) (← links)
• The intersection of all maximum stable sets of a tree and its pendant vertices (Q998466) (← links)
• Critical and maximum independent sets of a graph (Q1671323) (← links)
• On upper bounds for the independent transversal domination number (Q1693131) (← links)
• Problems on matchings and independent sets of a graph (Q1744740) (← links)
• Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
• Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
• Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
• On the critical difference of almost bipartite graphs (Q2159389) (← links)
• Nullspace vertex partition in graphs (Q2230734) (← links)
• Monotonic properties of collections of maximum independent sets of a graph (Q2314418) (← links)
• Two more characterizations of König-Egerváry graphs (Q2403804) (← 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)
• A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
• Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
• On an annihilation number conjecture (Q4988857) (← links)
• On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)