Bounded Stable Sets: Polytopes and Colorings

DOI10.1137/S089548019630978XMaRDI QIDQ4255821zbMATH OpenFDO

Authors K. Kilakos, Jeannette Janssen

Publication date 27 June 1999

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S089548019630978X

zbMATH Keywords

bounded coloringfractional graph coloringstable set polytope

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial optimization (90C27)

Recommendations

• Fixed cardinality stable sets
• Polyhedral sets and integer rounding
• A polyhedral study of the maximum stable set problem with weights on vertex-subsets
• Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
• Stable multi-sets

Cited in

(10)

• Using stable sets to bound the chromatic number
• Fixed cardinality stable sets
• The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• Bounded colouring motivated by the limited resource partially concurrent open shop problem
• A one-to-one correspondence between colorings and stable sets
• Maximum stable sets in analogs of Kneser and complete graphs
• Polyhedral sets and integer rounding
• A polyhedral study of the maximum stable set problem with weights on vertex-subsets
• Stable sets in flag spheres

This page was built for publication: Bounded Stable Sets: Polytopes and Colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255821)