ISGCI project home  All classes  Smallgraphs

Graphclass: 2-connected cap (4-fan,Cn+4,K5 - e,S3,co-(H),co-(K3 cup 2K1))-free

References: [1313]
Equivalent classes:  square of tree 
Related classes:  2-connected   (4-fan,Cn+4,K5 - e,S3,co-(H),co-(K3 cup 2K1))-free 

Inclusions

Minimal superclasses:  2-connected   (4-fan,Cn+4,K5 - e,S3,co-(H),co-(K3 cup 2K1))-free 

Problems summary

Recognition: Unknown to ISGCI details
Cliquewidth expression: Unknown to ISGCI details
Cliquewidth: Unknown to ISGCI details
Weighted independent set:Lineardetails
Independent set:Lineardetails
Domination: Unknown to ISGCI details

Algorithms for Recognition

Algorithms for Cliquewidth expression

See also : Cliquewidth : Weighted independent set : Domination

Algorithms for Cliquewidth

See also : Cliquewidth expression

Algorithms for Weighted independent set

Linear from chordal  [1166]
Polynomial from (K2,3,P,hole)-free  [1107]
Polynomial from interval filament  [1159]
Polynomial from perfect  [476]
Polynomial [O(V^4)] from weakly chordal  [997]
Polynomial from subtree overlap  [1123]
See also : Cliquewidth expression : Independent set

Algorithms for Independent set

Linear from chordal  [425] [931]
Polynomial from Gallai  [1081]
Polynomial [O(VE)] from weakly chordal  [530] [1119]
Polynomial from Meyniel  [169]
Polynomial from clique separable  [1081]
See also : Weighted independent set

Algorithms for Domination

See also : Cliquewidth expression