extension of subgraph isomorphism known as graph mining is also of interest in that area. Frequent subtree mining Induced subgraph isomorphism problem Maximum...

graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph...

is the induced subgraph of all vertices adjacent to it. The induced subgraph isomorphism problem is a form of the subgraph isomorphism problem in which...

efficiently. This problem is a special case of the subgraph isomorphism problem, which asks whether a given graph G contains a subgraph that is isomorphic...

with at least k vertices. This problem is NP-complete. It is a generalization of the induced subgraph isomorphism problem, which arises when k equals the...

computer science, a maximum common subgraph may mean either: Maximum common induced subgraph, a graph that is an induced subgraph of two given graphs and has...

uniquely determined by its vertex-deleted subgraphs. The snake-in-the-box problem: what is the longest possible induced path in an n {\displaystyle n} -dimensional...

path problem, directed and undirected.: GT37, GT38, GT39  Induced subgraph isomorphism problem Graph intersection number: GT59  Longest path problem: ND29 ...

clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph...

of vertices. Maximum common subgraph isomorphism problem Subgraph isomorphism problem Induced subgraph isomorphism problem Bahiense, L.; Manic, G.; Piva...

similar problem is finding induced subgraphs in a given graph. Again, some important graph properties are hereditary with respect to induced subgraphs, which...

possible induced path in a hypercube; it can be viewed as a special case of the induced subgraph isomorphism problem. There is a similar problem of finding...

solve a problem in extremal graph theory, of constructing a graph with a given number of edges and vertices whose largest tree induced as a subgraph is as...

Unsolved problem in mathematics Are graphs uniquely determined by their subgraphs? More unsolved problems in mathematics Informally, the reconstruction...

invariants are instrumental for fast recognition of graph isomorphism, or rather non-isomorphism, since for any invariant at all, two graphs with different...

removes them from the graph. These actions are repeated on the remaining subgraph until no vertices remain. The worst-case complexity of DSatur is O ( n...

to isomorphism. It can be represented as an induced subgraph of G, and is a core in the sense that all of its self-homomorphisms are isomorphisms. 4.  In...

graphs with bounded FVS number. Some examples are graph isomorphism and the path reconfiguration problem. unpublished results due to Garey and Johnson, cf....

constructing their cotrees and applying a linear time isomorphism test for labeled trees. If H is an induced subgraph of a cograph G, then H is itself a cograph;...

overall graph is a homogeneous graph, meaning that every isomorphism between two of its induced subgraphs can be extended to an automorphism of the whole graph...

Z} containing X {\displaystyle X} as an induced subgraph such that every isomorphism between induced subgraphs of X {\displaystyle X} extends to an automorphism...

for induced subgraphs. Roughly speaking, instead of finding a monochromatic subgraph, we are now required to find a monochromatic induced subgraph. In...

that is not an induced subgraph of a given graph. The exponential time hypothesis also implies that no quasi-polynomial-time problem can be NP-complete...

graphs are connected-homogeneous, meaning that every isomorphism between two connected induced subgraphs can be extended to an automorphism of the whole graph...

augmenting path with respect to M. An induced matching is a matching that is the edge set of an induced subgraph. In any graph without isolated vertices...

to isomorphisms of induced subgraphs of G and H. Therefore, the modular product graph can be used to reduce problems of induced subgraph isomorphism to...

called an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-induced minor-free...

subgraph of H. If a homomorphism f : G → H is a bijection, and its inverse function f −1 is also a graph homomorphism, then f is a graph isomorphism....

it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms when the subgraph pattern that it is...

results on subgraph isomorphism in sparse graphs to search for atoms) for graphs of bounded expansion. However, on general graphs the problem is W[1]-hard...