chordal (2K2,C4,C5,S3,net)-free (2K2,C4,C5)-free (2P3,3K2,C4,C5,H,P2 
P4,P5,S3,X1,X160,co-(X159),co-(X161),co-(X162),co-(X46),co-(X70),net,rising sun)-free (3K1,C4,C5)-free AC AT-free chordal (C4,C5,C6,C7,C8,claw,diamond)-free (C4,P4,dart)-free (C4,P4)-free (C4,odd anti-cycle)-free C4-free co-comparability (Cn+4,P5,claw,gem)-free (Cn+4,S3 K1,claw,net)-free (Cn+4,T2,X31,XF2n+1,XF3n)-free (Cn+4,T2,XF2n+1)-free (Cn+4,T2,net)-free (Cn+4,claw,gem)-free (Cn+4,claw,net)-free (Cn+4,claw)-free (S3,net)-free split (T2,cycle)-free boxicity 1 caterpillar chordal (claw,net)-free chordal claw-free chordal co-chordal chordal co-comparability chordal cograph chordal diametral path chordal dominating pair chordal domino chordal proper circular arc co-probe threshold cograph interval comparability graphs of arborescence orders intersection graph of nested intervals interval line graphs of acyclic multigraphs quasi-threshold split superfragile trivially perfect | Recognition: | Polynomial | details |
| Cliquewidth expression: | Unbounded or NP-complete | details |
| Cliquewidth: | Unbounded | details |
| Weighted independent set: | Polynomial | details |
| Independent set: | Polynomial | details |
| Domination: | NP-complete | details |
Algorithms for Recognition
Polynomial
| Finite forbidden subgraph characterization |
Algorithms for Cliquewidth expression
See also
: Cliquewidth : Weighted independent set : Domination
Algorithms for Cliquewidth
Unbounded from Fn grid
[1176]
Unbounded from unit interval
[1177]
Unbounded from split
[1176]
See also
: Cliquewidth expression
Algorithms for Weighted independent set
Polynomial
[1108]
See also
: Cliquewidth expression : Independent set
Algorithms for Independent set
Polynomial from (P,T2)-free
[1305]
See also
: Weighted independent set
Algorithms for Domination
NP-complete from split
[1144]
[1145]
See also
: Cliquewidth expression