The following pages link to (Q3286847):
Displaying 50 items.
- Even pairs in square-free Berge graphs (Q322216) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On weakly diamond-free Berge graphs (Q1126205) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- Antitwins in partitionable graphs (Q1210574) (← links)
- Degrees and independent sets of hypergraphs (Q1230798) (← links)
- Matroidal graphs (Q1244250) (← links)
- Induced matchings (Q1262877) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- The independence number of graphs in terms of degrees (Q1313874) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Path parity and perfection (Q1356748) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Finding balance: split graphs and related classes (Q1753048) (← links)
- On the quasi-locally paw-free graphs (Q1810626) (← links)
- On dart-free perfectly contractile graphs (Q1885896) (← links)
- Discs in unbreakable graphs (Q1900520) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- On balanced graphs (Q2583124) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- On the dominator coloring in proper interval graphs and block graphs (Q2788718) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- Fast Skew Partition Recognition (Q5302744) (← links)
