Pages that link to "Item:Q2507503"
From MaRDI portal
The following pages link to On rank-perfect subclasses of near-bipartite graphs (Q2507503):
Displayed 9 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- (Q2857431) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)