ISGCI project home All classes SmallgraphsGraphclass: (3K1,house)-free
Complement classes:
(P5,triangle)-free
See also:
house 3K1
Inclusions
Minimal superclasses:
(3K1,co-(E))-free (4K1,house)-free (P,co-gem,house)-free (P5,co-(X38),co-gem)-free (P5,bull,house)-free (P5,co-domino,co-gem)-free (P5,fork,house)-free (P5,house)-free (bull,fork,house)-free claw-free
upper domination perfect (co-cricket,house)-free (co-diamond,house)-free
Maximal subclasses:
(2,0)-colorable
chordal (3K1,C4,C5)-free (C4,odd anti-cycle)-free
Problems summary
Algorithms for Recognition
Polynomial
| | Finite forbidden subgraph characterization |
Algorithms for Cliquewidth expression
Linear from (P5,bull,house)-free
[1187]
[1185]
Linear from (bull,fork,house)-free
[1124]
[1185]
Linear from (P5,fork,house)-free
[1185]
[402]
See also
: Cliquewidth : Weighted independent set : Domination
Algorithms for Cliquewidth
Bounded from (P,co-gem,house)-free
Bounded from (co-gem,house)-free
Bounded from (co-diamond,house)-free
See also
: Cliquewidth expression Algorithms for Weighted independent set
Linear from AT-free
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 from (P5,cricket)-free
[1110]
Polynomial from (P,P5)-free
[1353]
Polynomial from K2
claw-free
[1290]
Polynomial [O(VE)]
from co-gem-free
| | Because for all v: G[\co{N}(v)] is P_4-free
|
Polynomial from (P5,house)-free
[1109]
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 4K1-free
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 (P5,X82,X83)-free
[1246]
Polynomial [O(VE)]
from (bull,fork)-free
[1124]
[307]
Polynomial from (K2,3,P,P5)-free
[1107]
See also
: Cliquewidth expression : Independent set Algorithms for Independent set
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 AT-free
[1152]
Polynomial [O(VE)]
from (claw,net)-free
[1127]
See also
: Cliquewidth expression