On rank-perfect subclasses of near-bipartite graphs
From MaRDI portal
Publication:2507503
DOI10.1007/s10288-005-0077-7zbMath1134.90551OpenAlexW2061303062MaRDI 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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (13)
Clique and chromatic number of circular-perfect graphs ⋮ Comparing Imperfection Ratio and Imperfection Index for Graph Classes ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ $t$-Perfection in $P_5$-Free Graphs ⋮ Characterizing N+-perfect line graphs ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ On circular-perfect graphs: a survey ⋮ On the Chvátal rank of linear relaxations of the stable set polytope ⋮ Unnamed Item ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ Characterizing and bounding the imperfection ratio for some classes of graphs ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
This page was built for publication: On rank-perfect subclasses of near-bipartite graphs
