The following pages link to Perfect zero–one matrices (Q4770779):
Displaying 47 items.
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- On essential components and critical sets of a graph (Q1377850) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Cayley partitionable graphs and near-factorizations of finite groups (Q1422434) (← links)
- Elementary bipartite graphs and unique colourability (Q1612755) (← links)
- Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes (Q1657978) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- Odd cycles and matrices with integrality properties (Q1823869) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- Uniquely colorable perfect graphs (Q1837699) (← links)
- About skew partitions in minimal imperfect graphs (Q1850559) (← links)
- On the Laplacian spectrum of (\(\alpha,\omega\))-graphs (Q1864581) (← links)
- Generalized perfect graphs: Characterizations and inversion (Q1894378) (← links)
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\) (Q1900147) (← links)
- Directed Moore hypergraphs (Q1902896) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Minimal imperfect graphs: A simple approach (Q1924490) (← links)
- Forced color classes, intersection graphs and the strong perfect graph conjecture (Q1978716) (← links)
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs (Q1978718) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Grinstead's conjecture is true for graphs with a small clique number (Q2433715) (← links)
- A Berge-keeping operation for graphs (Q2433716) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time (Q2804992) (← links)
- On the Chvàtal-rank of antiwebs (Q2883565) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
- On cliques associated to 3-set packing problems (Q3439164) (← links)
- On determining the imperfection ratio (Q3439498) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties (Q5106390) (← links)
- (Q5708546) (← links)
- On the strong perfect graph conjecture (Q5905679) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)
- A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)
- The robust chromatic number of graphs (Q6598012) (← links)
