ISGCI project home  All classes  Smallgraphs

Graphclass: (2K3,4K1,C7,X38,X39,co-(W4 cup K1),co-(W5),co-(X86),co-(X87),co-(X88),co-(X89),co-(X90),butterfly cup K1,diamond)-free

Complement classes:  1-bounded tripartite   (K3,3,K4,W4 cup K1,W5,X86,X87,X88,X89,X90,co-(C7),co-(X38),co-(X39),co-(butterfly cup K1),co-diamond)-free 
See also: diamond co-(X89) co-(X87) X39 co-(W4 cup K1) co-(W5) X38 co-(X88) co-(X86) butterfly cup K1 2K3 co-(X90) 4K1 C7

Inclusions

Minimal superclasses:  4K1-free   (K1,4,diamond)-free   line graphs of linear hypergraphs of rank 3 

Problems summary

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

Algorithms for Recognition

Polynomial
     Finite forbidden subgraph characterization


Algorithms for Cliquewidth expression

See also : Cliquewidth : Weighted independent set : Domination

Algorithms for Cliquewidth

See also : Cliquewidth expression

Algorithms for Weighted independent set

Polynomial from K2 cup claw-free  [1290]
Polynomial from 4K1-free 
See also : Cliquewidth expression : Independent set

Algorithms for Independent set

See also : Weighted independent set

Algorithms for Domination

See also : Cliquewidth expression