Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property

DOI10.1007/978-3-642-36694-9_8zbMath1346.05208OpenAlexW1789171841MaRDI QIDQ4910807

C. Snels, Gianpaolo Oriolo, Flavia Bonomo-Braberman, Gautier Stauffer

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_8

zbMATH Keywords

clique coverbidirected graphsEdmonds-Johnson propertyclaw-free perfect graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Neighborhood persistency of the linear optimization relaxation of integer linear optimization

This page was built for publication: Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property