Searching for "H-domination in graphs." – sorted by Relevance.
3 documents found, showing 1 through 3.
-
Clique-width for four-vertex forbidden subgraphs
- … dominates the graph G if H has no 0-vertex in G. See Figure 3 for the definition of chair, P, bull, gem…
- Cited by 2 (0 self) – Add To MetaCart
-
New Graph Classes of Bounded Clique-Width II
- … x for S = fa; bg respectively S = fxg, etc. The subgraph H dominates the graph G if there is no 0…
- Add To MetaCart
-
P_6- and triangle-free graph revisited: structure and bounded clique-width
- … in H. We say that H has no k-vertex if there is no k-vertex for H. The subgraph H dominates the graph G…
- Add To MetaCart
Showing 1 through 3.
