On rank-perfect subclasses of near-bipartite graphs
From MaRDI portal
Publication:2507503
DOI10.1007/s10288-005-0077-7zbMath1134.90551MaRDI QIDQ2507503
Publication date: 11 October 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0077-7
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Computing clique and chromatic number of circular-perfect graphs in polynomial time, Characterizing and bounding the imperfection ratio for some classes of graphs, 2-clique-bond of stable set polyhedra, Computing the clique number of \(a\)-perfect graphs in polynomial time, Unnamed Item, On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs, Clique and chromatic number of circular-perfect graphs, On the Chvátal rank of linear relaxations of the stable set polytope, Comparing Imperfection Ratio and Imperfection Index for Graph Classes