Induced subgraph information

graphs, and even multigraphs. The induced subgraph G [ S ] {\displaystyle G[S]} may also be called the subgraph induced in G {\displaystyle G} by S {\displaystyle...

other graphs as subgraphs, induced subgraphs, or minors. If H is one of the graphs that does not occur as a subgraph, induced subgraph, or minor, then...

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...

computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both G and H, and that has as many...

graphs from the family which contain any of these forbidden graphs as (induced) subgraph or minor. A prototypical example of this phenomenon is Kuratowski's...

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

mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices...

these nine graphs as an induced subgraph. That is, a graph is a line graph if and only if no subset of its vertices induces one of these nine graphs...

graph is an induced subgraph of the Rado graph, and can be found as an induced subgraph by a greedy algorithm that builds up the subgraph one vertex at...

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...

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

induced subgraph of a given graph. Again, this is NP-hard, but fixed-parameter tractable when all but a few vertices belong to the induced subgraph....

size of the maximum clique, both in the graph itself and in every induced subgraph. In all graphs, the chromatic number is greater than or equal to the...

a subgraph is testable. In 1999, Alon, Fischer, Krivelevich, and Szegedy showed that for every graph H the property of not contain H as an induced subgraph...

and vice versa. Any induced subgraph of the complement graph of a graph G is the complement of the corresponding induced subgraph in G. An independent...

nontrivial induced subgraph has at least two vertices with the same neighbourhoods. A cograph is a graph in which every connected induced subgraph has a disconnected...

cycle transversal, equivalent to asking for the largest bipartite induced subgraph Unfriendly partition, a related concept for infinite graphs Edwards...

their forbidden induced subgraphs. A perfect graph is an undirected graph with the property that, in every one of its induced subgraphs, the size of the...

product of graphs to reduce the problem of finding the maximum common induced subgraph of two graphs to the problem of finding a maximum clique in their product...

graph, for k > 2. The half-square of a bipartite graph G is the subgraph of G2 induced by one side of the bipartition of G. Map graphs are the half-squares...

vertices which are endpoints of the matching edges (it is an induced subgraph). An induced matching can also be described as an independent set in the...

into two subsets, such that the induced subgraph formed by one of the two subsets is disconnected and the induced subgraph formed by the other subset is...

Krivelevich, Michael (2020). "Every graph contains a linearly sized induced subgraph with all degrees odd". arXiv:2009.05495 [math.CO]. Honner, Patrick...