Pages that link to "Item:Q1245851"
From MaRDI portal
The following pages link to Critical perfect graphs and perfect 3-chromatic graphs (Q1245851):
Displaying 33 items.
- Three-colourable perfect graphs without even pairs (Q412165) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Two classes of perfect graphs (Q1112847) (← links)
- The strong perfect graph conjecture for pan-free graphs (Q1112848) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- The strong perfect graph conjecture for toroidal graphs (Q1159682) (← links)
- A classification of certain graphs with minimal imperfection properties (Q1160632) (← links)
- On the strong perfect graph conjecture and critical graphs (Q1165250) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Combinatorial designs related to the strong perfect graph conjecture (Q1255951) (← links)
- Near-perfect matrices (Q1332310) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- On transversals in minimal imperfect graphs (Q1356752) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- Forced color classes, intersection graphs and the strong perfect graph conjecture (Q1978716) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- Circular-imperfection of triangle-free graphs (Q3503467) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- (Q5708618) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
