Beyond perfection: computational results for superclasses

DOI10.1007/978-3-642-38189-8_6MaRDI QIDQ5265167zbMATH OpenOpenAlexFDO

Authors Arnaud Pêcher, Annegret K. Wagler

Publication date 22 July 2015

Published in Facets of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38189-8_6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Computing the clique number of a-perfect graphs in polynomial time
• Polynomial time computability of some graph parameters for superclasses of perfect graphs
• Computing clique and chromatic number of circular-perfect graphs in polynomial time
• On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs

Cited in

(1)

• On circular-perfect graphs: a survey

This page was built for publication: Beyond perfection: computational results for superclasses

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