Pages that link to "Item:Q3960467"
From MaRDI portal
The following pages link to Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467):
Displayed 24 items.
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- 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)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← 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)
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- On vertices contained in all or in no metric basis (Q2161262) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- Vizing's conjecture: a survey and recent results (Q3113279) (← 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)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
- Edges contained in all or in no minimum edge dominating set of a tree (Q5197545) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)