Polyhedral sets and integer rounding

MaRDI QIDQ2741357zbMATH OpenFDO

Authors Thomas Niessen, Jaakob Kind

Publication date 23 September 2001

Full work available at URL http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Bounded Stable Sets: Polytopes and Colorings
• Stable multi-sets
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs
• On cycles and the stable multi-set polytope
• scientific article; zbMATH DE number 3882470

Cites work

• An O(qn) algorithm to q-color a proper family of circular arcs
• Colouring series-parallel graphs
• Fractional and integral colourings
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Near-perfect matrices
• Normal hypergraphs and the perfect graph conjecture

Cited in

(3)

• Inner and outer rounding of Boolean operations on lattice polygonal regions
• Direct transformations between sets of integers and hilbert polygons
• Fully Bounded Polyhedral Analysis of Integers with Wrapping

This page was built for publication: Polyhedral sets and integer rounding

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