Pages that link to "Item:Q2517790"
From MaRDI portal
The following pages link to A one-to-one correspondence between colorings and stable sets (Q2517790):
Displaying 16 items.
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- A new facet generating procedure for the stable set polytope (Q2840706) (← links)
- The sandwich line graph (Q2861516) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- Clique-connecting forest and stable set polytopes (Q5189884) (← links)