• Aucun résultat trouvé

Parameterized Complexity of Independent Set in H-free Graphs

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Parameterized Complexity of Independent Set in H-free Graphs"

Copied!
37
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Figure

Fig. 1 Gadget T G i,j representing a tile and its adjacencies with T G i,j−1 and T G i,j+1 , for p = 1
Fig. 3 Two consecutive tiles and the representation of their adjacencies (representing type T r adjacencies).
Fig. 4 A symbolic representation of the hardness constructions. To the left, only half-graphs (blue) are used between the cliques, as in the proof of Theorem 2
Fig. 5 The two ways the cricket appears in the third construction. The red edges between two adjacent cliques symbolize an anti-matching, whereas the blue edge symbolizes a C 4 -free graph
+4

Références

Télécharger maintenant ( PDF - 37 Page - 1.20 MB )

Documents relatifs