scientific article; zbMATH DE number 2196279

MaRDI QIDQ5465111zbMATH OpenFDO

Authors Annegret K. Wagler

Publication date 22 August 2005

zbMATH Keywords

perfect graphsstable set polytope

Mathematics Subject Classification ID

Perfect graphs (05C17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On determining the imperfection ratio
• Near-perfect matrices
• scientific article; zbMATH DE number 3882470
• Rank-perfect and weakly rank-perfect graphs
• Comparing imperfection ratio and imperfection index for graph classes

Cited in

(14)

• Characterizing and bounding the imperfection ratio for some classes of graphs
• Near-perfect matrices
• Rank-perfect and weakly rank-perfect graphs
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs
• On the facets of stable set polytopes of circular interval graphs
• Almost perfect matrices and graphs.
• The theta body and imperfection
• On the k-dominating set polytope of web graphs
• Comparing imperfection ratio and imperfection index for graph classes
• Lovász and Schrijver N_+-relaxation on web graphs
• On strongly circular-perfectness
• On determining the imperfection ratio
• The 1-persistency of the clique relaxation of the stable set polytope: a focus on some forbidden structures
• On packing and covering polyhedra of consecutive ones circulant clutters

This page was built for publication:

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