Conversely, in distance-hereditary graphs, every induced path is a shortest path. (wikipedia.org)
According to the strong perfect graph theorem, induced cycles and their complements play a critical role in the characterization of perfect graphs. (wikipedia.org)
Cliques and independent sets are induced subgraphs that are respectively complete graphs or edgeless graphs. (wikipedia.org)
I didn't read the paper carefully yet, but as far as I understood, there is a dichotomy in the sense that if $C$ is finite then the problem is in $P$, but if $C$ has an infinite number of graphs then the induced subgraph isomorphism is $W[1]$ complete (Corollary 4, page 6). (stackexchange.com)
Induced subgraphs of graphs with large chromatic number. (princeton.edu)
Dive into the research topics of 'Induced subgraphs of graphs with large chromatic number. (princeton.edu)
Scott conjectured in [6] that the class of graphs with no induced subdivision of a given graph is χ-bounded. (cambridge.org)
6] Scott , A. ( 1997 ) Induced trees in graphs of large chromatic number. (cambridge.org)
There are numerous interesting classes of graphs which are based upon forbidding one or more induced subgraphs. (sfu.ca)
Induced Matchings in Graphs of Maximum Degree 4, arXiv . (uni-ulm.de)
with M.A. Henning , C. Löwenstein , and D. Rautenbach , Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs, arXiv . (uni-ulm.de)
with M.A. Henning , C. Löwenstein , and T. Sasse , Induced Cycles in Graphs, arXiv . (uni-ulm.de)
with D. Rautenbach and T. Sasse , Induced Matchings in Subcubic Graphs, SIAM J. Discrete Math . (uni-ulm.de)
As the most well-known computational method of analogical reasoning, Structure-Mapping Theory (SMT) abstracts both target and base subjects into relational graphs and forms the cognitive process of analogical reasoning by finding a corresponding subgraph (i.e., correspondence) in the target graph that is aligned with the base graph. (nec-labs.com)
We study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. (utoronto.ca)
Matchings1
with M. A. Duarte, L. D. Penso , D. Rautenbach and U. Souza, Maximum Induced Matchings close to Maximum Matchings, Theoretical Computer Science 588 (2015), 131-137. (uni-ulm.de)
Isomorphism5
The induced subgraph isomorphism problem is a form of the subgraph isomorphism problem in which the goal is to test whether one graph can be found as an induced subgraph of another. (wikipedia.org)
Is induced subgraph isomorphism easy on an infinite subclass? (stackexchange.com)
There is another interesting result stating that if $P\neq NP$ then there are classes for which the induced isomorphism is neither in $P$ nor $NP$ complete. (stackexchange.com)
From the literature I've reviewed, I've seen the following options: Node-induced subgraph isomorphism checking: Using VF2, ISMAGS, etc. (mathoverflow.net)
I am interested in algorithms for computing all subgraphs (not necessarily induced) of a graph $G$ up to $Aut(G)$ isomorphism. (mathoverflow.net)
Vertex5
The neighborhood of a vertex is the induced subgraph of all vertices adjacent to it. (wikipedia.org)
k$ and the subgraph of $G$ restricted to the vertex set $S$ admits a perfect matching? (stackexchange.com)
2017], we also consider the colorful variant of the problem, where each vertex of G is colored with some color from V (H) and we require to hit only induced copies of H with matching colors. (cnrs.fr)
We focus on the simple yet powerful class of algorithms that in each pass run Greedy on a vertex-induced subgraph of the input graph. (dagstuhl.de)
The s-clubs model cohesive social subgroups as vertex subsets that induce subgraphs of diameter at most s. (optimization-online.org)
Algorithms1
Linear-time certifying recognition algorithms and forbidden induced subgraphs. (google.com.hk)
Forbidden1
bringing them into the realm of forbidden induced subgraphs has until recently remained out of reach. (ucsb.edu)
Embeddings1
Specifically, we design a geometric constraint embedding space to induce subgraph relation from node embeddings for efficient subgraph search. (nec-labs.com)
Topological2
Here, we show that the problem of finding a large induced subgraph that is an expander can be reduced to the simpler problem of finding a large topological minor that is an expander. (combinatorics.org)
1] Bollobás , B. and Thomason , A. ( 1998 ) Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs. (cambridge.org)
Subset2
In the mathematical field of graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges (from the original graph) connecting pairs of vertices in that subset. (wikipedia.org)
log n}\leq n^{\log n}$, and checking if the graph induced by the subset has a perfect matching using Tutte's characterization takes $O(2^{\log n})=O(n)$ time, hence it is unlikely for it be even NP-complete unless exponential time hypothesis is wrong. (stackexchange.com)
Shortest path1
The shortest path between any two vertices in an unweighted graph is always an induced path, because any additional edges between pairs of vertices that could cause it to be not induced would also cause it to be not shortest. (wikipedia.org)
Graph induced2
If the given initial nodes are in different connected components of the graph, induced subgraph will be produced in each connected component. (ultipa.com)
Statistical descriptions of Erdös number data, a file of the sub graph induced by Erdös coauthors, Erdös number record holders, facts about collaboration in mathematical research and the collaboration graph, including some information about publishing habits of mathematicians (for example, the median number of papers is 2, and the mean is about 7). (google.com)
Paths1
Induced paths are induced subgraphs that are paths. (wikipedia.org)
Girth1
The girth of a graph is defined by the length of its shortest cycle, which is always an induced cycle. (wikipedia.org)
We denote the set of all unvisited vertices whose $D$-values are not infinite (i.e. in the subgraph each of which has a path from the source to itself) by OuterVx. (edu.pl)
Isomorphic1
This dataset contains information on graphlets, connected non-isomorphic induced subgraphs. (memetracker.org)
Nodes4
Induced Subgraph algorithm can compute the corresponding induced subgraph from a given set of nodes and return the edges in that induced subgraph in the form of path. (ultipa.com)
Specifying a set of nodes in the graph as initial nodes, and finding edges which two endpoints are both of those initial nodes, these initial nodes and edges that are found form an induced subgraph. (ultipa.com)
The endpoints of all red edges in the graph above are both red nodes, while all black edges have at least one endpoint that is not red node, all red nodes and red edges in the graph form an induced subgraph. (ultipa.com)
For each request, the Potts MF network (Peterson & S ¨oderberg, 1989) defines an (inverted) "fuzzy" spanning tree (a subgraph without loops con- necting all nodes) rooted at the end node. (lu.se)
Maximal1
of G if it is a maximal subgraph of G with vertices V(H) . (wisc.edu)
Cycles1
Induced cycles are induced subgraphs that are cycles. (wikipedia.org)
Edges1
For directed edges, Induced Subgraph algorithm ignores the direction of edges but calculates them as undirected edges. (ultipa.com)
Node1
Self-loop edge of the initial node must be one edge in the induced subgraph. (ultipa.com)
Large1
We also show that every large subgraph of an expander graph contains a large subgraph which is itself an expander. (combinatorics.org)
Significance1
This framework is motivated by the need to detect subgraphs of significance in temporal networks, e.g., social and biological networks that evolve over time. (optimization-online.org)
Largest1
In this work we introduce and study the problem of identifying a largest induced subgraph of a given graph G that is locally irregular. (dagstuhl.de)
Show1
We will show that almost surely any induced subgraph of size (1+? (rutgers.edu)
Size2
begingroup$ It seems that most problems of the sort 'how man induced subgraphs of size k have property X? (stackexchange.com)
For a fixed graph H, the HIS Deletion problem asks, given a graph G, for the minimum size of a set S ⊆ V (G) such that G \ S does not contain H as an induced subgraph. (cnrs.fr)
Problem1
This paper presents some strong valid inequalities for the Maximum Common Induced Subgraph Problem (MCIS) and the proofs that the inequalities are facet-defining under certain conditions. (optimization-online.org)
Problems1
In this article we address the MSPP using feedback Potts neural networks, which have proved to be powerful in other resource allocation problems, with (Lagerholm, Peterson, & S ¨oderberg, 1997) or without (Gisl´en, Peter- son, & S ¨oderberg, 1992) a nontrivial topology. (lu.se)
Target1
Induced subgraph, as one of the basic concepts in Graph Theory, is commonly used to dig the direct connections between target entities. (ultipa.com)