The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- The matrix Jacobson graph of finite commutative rings (Q5081218) (← links)
- Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- Structure of super strongly perfect graphs (Q5101913) (← links)
- Some properties of subgroup complementary addition Cayley graphs on abelian groups (Q5101918) (← links)
- Graphs defined on groups (Q5102166) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- A study of enhanced power graphs of finite groups (Q5113133) (← links)
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
- (Q5158022) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- On subspace inclusion graph of a vector space (Q5206297) (← links)
- On graphs with the smallest eigenvalue at least −1 − √2, part III (Q5217093) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
- Perfect Digraphs (Q5251198) (← links)
- The Inclusion Ideal Graph of Rings (Q5256746) (← links)
- Fast Skew Partition Recognition (Q5302744) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- Resource convertibility and ordered commutative monoids (Q5360212) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- Perfect non-commuting graphs of matrices over chains (Q5370822) (← links)
- The Structure of Claw‐Free Perfect Graphs (Q5417818) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- Envy-free pricing in multi-item markets (Q5501961) (← links)
- The order supergraph of the power graph of a finite group (Q5742740) (← links)
- (Q5743476) (← links)
- Parameters of the coprime graph of a group (Q5854514) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On the enhanced power graph of a finite group (Q5856790) (← links)
- On enhanced power graphs of certain groups (Q5859514) (← links)
- Brilliance or steadiness? A suggestion of an alternative model to Hardy's model concerning golf (1945) (Q5860076) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Graph transformations preserving the stability number (Q5891088) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
- Claw-free circular-perfect graphs (Q5900081) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Graph transformations preserving the stability number (Q5916099) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)