459 search results - page 9 / 92 » Detecting induced subgraphs |
SADM
2010
13 years 5 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
ENDM
2008
13 years 7 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
JGT
2006
13 years 7 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
DM
2011
13 years 2 months ago
2011
The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained
ENDM
2008
13 years 7 months ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...