The following pages link to Topics on perfect graphs (Q798301):
Displaying 50 items.
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Preperfect graphs (Q684406) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- A characterization of intersection graphs of the maximal rectangles of a polyomino (Q687125) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- On a conjecture of Hoàng and Tu concerning perfectly orderable graphs (Q860461) (← links)
- Completely separable graphs (Q908944) (← links)
- On the closure of triangle-free graphs under substitution (Q915449) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Murky graphs (Q1101470) (← links)
- Paw-free graphs (Q1108293) (← links)
- Two classes of perfect graphs (Q1112847) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Parity graphs are kernel-M-solvable (Q1121920) (← links)
- A note on perfect orders (Q1124614) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- Coloring graphs with stable cutsets (Q1171066) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- On the complexity of testing for odd holes and induced odd paths (Q1175980) (← links)
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) (Q1175981) (← links)
- Finding large holes (Q1182105) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- A parallel algorithm for minimum weighted colouring of triangulated graphs (Q1193908) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- Antitwins in partitionable graphs (Q1210574) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Polyominos and perfect graphs (Q1322110) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
