The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- On circulant thin Lehman matrices (Q484160) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Perfect zero-divisor graphs (Q507501) (← links)
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Excluding paths and antipaths (Q520043) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- Perfect commuting graphs (Q528911) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Associated primes of monomial ideals and odd holes in graphs (Q610455) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Some properties of graphs determined by edge zeta functions (Q624533) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals (Q716459) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
