Pages that link to "Item:Q3960467"

The following pages link to Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467):

Displayed 13 items.

• Pseudo-Boolean optimization (Q697569) ‎ (← links)
• A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) ‎ (← links)
• Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) ‎ (← links)
• Persistency and matroid intersection (Q1035281) ‎ (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) ‎ (← links)
• The maximum clique problem (Q1318271) ‎ (← links)
• Combinatorial properties of the family of maximum stable sets of a graph (Q1348387) ‎ (← links)
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) ‎ (← links)
• On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) ‎ (← links)
• Crown reductions for the minimum weighted vertex cover problem (Q2473030) ‎ (← links)
• On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) ‎ (← links)
• Vertices contained in all minimum paired-dominating sets of a tree (Q3617962) ‎ (← links)
• Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) ‎ (← links)