ISGCI project home  All classes  Smallgraphs

Graphclass: chordal cap proper circular arc

Equivalent classes:  (Cn+4,S3 cup K1,claw,net)-free 
Complement classes:  (S3,co-(Cn+4),co-(S3 cup K1),co-claw)-free 
Related classes:  chordal   chordal cap (claw,net)-free   proper circular arc 

Inclusions

Minimal superclasses:  Berge cap claw-free   (C4,C5,T2)-free   (C4,X91,claw)-free   (Cn+4,H)-free   (Cn+4,T2,XF2n+1)-free   (Cn+4,T2,net)-free   (Cn+4,claw,net)-free   (Cn+4,claw)-free   Hamiltonian hereditary   (W4,claw)-free   chordal cap (claw,net)-free   chordal cap claw-free   chordal cap diametral path   chordal cap dominating pair   chordal cap domination perfect   (claw,net)-free   (claw,odd anti-hole,odd-hole)-free   (claw,odd anti-hole)-free   (claw,odd-hole)-free   claw-free cap perfect   proper circular arc 
Maximal subclasses:  (2,0)-colorable cap chordal   2-leaf power   (3K1,C4,C5)-free   (C4,odd anti-cycle)-free   (Cn+4,S3,claw,net)-free   (Cn+4,XF2n+1,XF3n,claw)-free   P3-free   (S3,claw,net)-free cap chordal   astral triple-free   chordal cap unit circular arc   claw-free cap interval   indifference   proper interval   unit interval 

Problems summary

Recognition:Lineardetails
Cliquewidth expression: Unbounded or NP-complete details
Cliquewidth:Unboundeddetails
Weighted independent set:Lineardetails
Independent set:Lineardetails
Domination:Lineardetails

Algorithms for Recognition

Linear
     From the constituent classes.



Algorithms for Cliquewidth expression

See also : Cliquewidth : Weighted independent set : Domination

Algorithms for Cliquewidth

Unbounded from unit interval  [1177]
See also : Cliquewidth expression

Algorithms for Weighted independent set

Linear from chordal  [1166]
Polynomial from K2 cup claw-free  [1290]
Polynomial from (C4,C5,T2)-free  [1108]
Polynomial from fork-free  [1099]
Polynomial from (K2,3,P,hole)-free  [1107]
Polynomial [O(n^2)] from circle  [1121]
Polynomial from interval filament  [1159]
Polynomial from claw-free  [783]
Polynomial [O(ln)] from circular arc 
     Where l is the minimum number of arcs passing through a given point on the circle. [995]

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 [O(n)] from circular arc  [1105] [1106] [1158]
Linear from chordal  [425] [931]
Polynomial from Gallai  [1081]
Polynomial from claw-free  [947]
Polynomial [O(VE)] from weakly chordal  [530] [1119]
Polynomial from (E,P)-free  [1305]
Polynomial [O(VE)] from (claw,net)-free  [1127] [515]
Polynomial from (P,T2)-free  [1305]
Polynomial from Meyniel  [169]
Polynomial from clique separable  [1081]
Polynomial from (P,star1,2,5)-free  [1349]
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

Linear from circular arc  [1143] [1158]
Polynomial [O(VE)] from (claw,net)-free  [1127]
See also : Cliquewidth expression