ISGCI project home  All classes  Smallgraphs

Graphclass: (3K1,C5,K5 - e,co-(C6 cup K1),co-(C7),co-(K3,3 cup K1),co-(K3,3-e cup K1),co-(domino cup K1))-free

Complement classes:  2-bounded bipartite   (C5,C6 cup K1,C7,K3,3 cup K1,K3,3-e cup K1,co-(K5 - e),domino cup K1,triangle)-free 
See also: co-(domino cup K1) co-(K3,3-e cup K1) co-(C6 cup K1) co-(K3,3 cup K1) 3K1 co-(C7) C5 K5 - e

Inclusions

Minimal superclasses:  (2,0)-colorable   (3K1,co-cross)-free   Berge   Berge cap bull-free   Berge cap claw-free   (C5,P5)-free   (K2,3,P,hole)-free   (X12,X5,X95,X96,X97,co-(X12),co-(X5),co-(X95),co-(X96),co-(X97),co-(claw cup triangle),claw cup triangle,co-cricket,co-twin-house,cricket,odd anti-hole,odd-hole,twin-house)-free   cal C(G)-perfect   co-(K2 cup claw)-free   (co-(star1,2,3),co-(sunlet4),odd anti-cycle)-free   bipartite cup co-bipartite cup co-line graphs of bipartite graphs cup line graphs of bipartite graphs   (bull,odd anti-hole,odd-hole)-free   bull-free cap perfect   (claw,odd anti-hole,odd-hole)-free   claw-free cap perfect   co-bipartite   kernel solvable   odd anti-cycle-free   (odd anti-hole,odd-hole)-free   odd-hole-free   perfect   perfect connected-dominant   perfectly 1-transversable 
Maximal subclasses:  (3K1,C5,butterfly,diamond)-free 

Problems summary

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

Algorithms for Recognition

Polynomial
     Finite forbidden subgraph characterization


Algorithms for Cliquewidth expression

See also : Cliquewidth : Weighted independent set : Domination

Algorithms for Cliquewidth

Bounded
     From the complement .


Bounded from (co-(star1,2,3),co-(sunlet4),odd anti-cycle)-free 
     From the complement .



Bounded from (co-(star1,2,3),odd anti-cycle)-free 
     From the complement .





See also : Cliquewidth expression

Algorithms for Weighted independent set

Linear from AT-free cap claw-free  [1157]
Polynomial [O(VE)] from (P5,fork)-free  [1125]
Polynomial [O(n^5)] from (K1,4,P5)-free  [1110]
Polynomial from (K2,3,P5)-free  [1110]
Polynomial [O(V^5E^3)] from Berge cap bull-free  [1278]
Polynomial from (P5,cricket)-free  [1110]
Polynomial from (P,P5)-free  [1353]
Polynomial from K2 cup claw-free  [1290]
Polynomial [O(VE)] from co-gem-free 
     Because for all v: G[\co{N}(v)] is P_4-free

Polynomial from fork-free  [1099]
Polynomial [O(n^6)] from (K3,3,P5)-free 
     Algorithm for (P_5,K_{m,m})-free (fixed m) [1118]

Polynomial [O(n^4)] from AT-free  [160]
Polynomial [O(n^8)] from (K4,4,P5)-free 
     Algorithm for (P_5,K_{m,m})-free (fixed m) [1118]

Polynomial from (K2,3,P,hole)-free  [1107]
Polynomial from 4K1-free 
Polynomial from interval filament  [1159]
Polynomial [O(n^{6p+2})] from (p,q<=2)-colorable  [1116]
Polynomial from (K1,4,P,P5,fork)-free  [1103]
Polynomial [O(n^4)] from (P5,claw)-free  [1110]
Polynomial from claw-free  [783]
Polynomial from perfect  [476]
Polynomial from (P5,X82,X83)-free  [1246]
Polynomial [O(VE)] from (bull,fork)-free  [1124] [307]
Polynomial from (K2,3,P,P5)-free  [1107]
Polynomial from subtree overlap  [1123]
See also : Cliquewidth expression : Independent set

Algorithms for Independent set

Linear from co-comparability  [1100]
Polynomial from claw-free  [947]
Polynomial from co-hereditary clique-Helly  [1298]
Polynomial from (K3,3-e,P5)-free  [1246]
Polynomial [O(VE)] from (P,P5)-free  [1117]
Polynomial from (E,P)-free  [1305]
Polynomial from (K2,3,P,P5)-free  [1346] [1107]
Polynomial [O(V^8)] from (P,P7)-free  [1351]
Polynomial from (C6,K3,3+e,P,P7,X37,X41)-free  [1346]
Polynomial [O(VE)] from (claw,net)-free  [1127] [515]
Polynomial from (P,T2)-free  [1305]
Polynomial [O(nm)] from (K3,3-e,P5,X98)-free  [1117]
Polynomial from (P,star1,2,5)-free  [1349]
Polynomial [O(V^{5})] from (K3,3-e,P5,X99)-free  [1307]
Polynomial from (P,P8)-free  [1306]
Open from (P,star1,2,3)-free  [1351]
Open from (P,star1,2,4)-free  [1351] [1306]
See also : Weighted independent set

Algorithms for Domination

Polynomial from co-comparability  [1150] [1151]
Polynomial from AT-free  [1152]
Polynomial [O(VE)] from (claw,net)-free  [1127]
See also : Cliquewidth expression