The following pages link to Perfect zero–one matrices (Q4770779):
Displaying 50 items.
- An extension of Lehman's theorem and ideal set functions (Q298985) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On circulant thin Lehman matrices (Q484160) (← links)
- A class of polynomially solvable 0-1 programming problems and an application (Q547367) (← links)
- Perfect \(0,\pm 1\) matrices (Q677152) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Thin Lehman matrices arising from finite groups (Q763068) (← links)
- On circular critical graphs (Q796546) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- An iterative approach to robust and integrated aircraft routing and crew scheduling (Q1046695) (← links)
- The train driver recovery problem-a set partitioning based model and solution method (Q1046697) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Locally perfect graphs (Q1105623) (← links)
- No antitwins in minimal imperfect graphs (Q1107542) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Discrete extremal problems (Q1152306) (← links)
- The strong perfect graph conjecture for toroidal graphs (Q1159682) (← links)
- A classification of certain graphs with minimal imperfection properties (Q1160632) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Meyniel graphs are strongly perfect (Q1171076) (← links)
- Properties of balanced and perfect matrices (Q1194854) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- A note on the total unimodularity of matrices (Q1236586) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- Combinatorial designs related to the strong perfect graph conjecture (Q1255951) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- \(P_4\)-domination in minimal imperfect graphs (Q1293209) (← links)
- Near-perfect matrices (Q1332310) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- A note on clutter partitions (Q1332941) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Order preserving assignments without contiguity (Q1356521) (← links)
- On transversals in minimal imperfect graphs (Q1356752) (← links)
- Perfect graphs with unique \(P_ 4\)-structure (Q1356763) (← links)
