scientific article

zbMath1072.05529MaRDI QIDQ2741357

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

This page was built for publication: