「Subgraph」の共起表現(1語右で並び替え)

意味
共起
表現

「Subgraph」の共起表現一覧(1語右で並び替え)

Subgraph

1語右で並び替え

該当件数:77件

be decomposed into three parts: an undirected subgraph, a directed subgraph, and directed edges poin
is odd, the order-k folded cube contains as a subgraph a complete binary tree with 2k − 1 nodes.
ove, any non-pseudoforest graph contains as a subgraph a handcuff, figure 8, or theta graph; any han
The concept of an overfull subgraph, an overfull graph that is a subgraph, immedi
is a set of vertices that induces a complete subgraph, and that is not a subset of the vertices of
via graph coloring, and provides a forbidden subgraph characterization of these graphs.
Therefore, this subgraph consists of two edge-disjoint paths from s to
To refine the model of the system, a subgraph could be placed below the node to refine the
Extended to subgraphs: a maximal subgraph disconnected by no less than a k-vertex cut i
Extended to subgraphs: a maximal subgraph disconnected by no less than a k-edge cut is
ery strongly perfect graphs (in every induced subgraph, every vertex belongs to an independent set m
The blue subgraph forms a clique (bottom right figure), while t
ing the two subsets form a complete bipartite subgraph, forms two smaller graphs by replacing each o
Now turn to the subgraph G24 of G' consisting of the vertices that are
For the target subgraph H in G to be discoverable, the enumeration ha
ertices u and v belong to a connected induced subgraph H of G, then some shortest path connecting u
vertices such that, for all k, every k-vertex subgraph has at most 2k −3 edges, and such that the wh
The condition that no subgraph have too many edges ensures that each edge co
KT algorithm to graphs which do not contain a subgraph homeomorphic to K3,3.
containing every n-vertex graph as an induced subgraph, if and only if it has an adjacency labelling
Erasure - Any subgraph in an even numbered depth may be erased.
For the subgraph in which all vertices have high degree, see k
s the forests F of G such that in the induced subgraph in V(G) − V(F), every connected component has
and coining the term "clique" for a complete subgraph in graph theory.
The assumptions are that the subgraph is duplicated that many times, the variables
r) vertex coloring in which every 2-chromatic subgraph is acyclic.
π of the vertices of G, such that any induced subgraph is optimally colored by the greedy algorithm
ces on the other side, and k edges contains a subgraph isomorphic to Ka,b.
um independent set problem is also an induced subgraph isomorphism problem in which one seeks to fin
n complexity theory and graph theory, induced subgraph isomorphism is an NP-complete decision proble
This problem is a special case of the subgraph isomorphism problem, which is known to be NP-
This is different from the subgraph isomorphism problem in that the absence of an
This method shows that many subcases of the subgraph isomorphism problem (an NP-complete problem)
an be viewed as a special case of the induced subgraph isomorphism problem.
In subgraph isomorphism, these "extra" edges in G2 may be
partite graph, finding its complete bipartite subgraph Km,n with maximal number of edges mn is an NP
Question: What is the largest induced subgraph of G1 isomorphic to an induced subgraph of G2
A blossom is a factor-critical subgraph of a graph.
Any bipartite graph is a subgraph of a complete bipartite graph, and correspond
the β-skeleton (with either definition) is a subgraph of the Gabriel graph, which is a subgraph of
the set of the cycles constitutes a spanning subgraph of G.
er k, deciding whether G1 contains an induced subgraph of at least k edges isomorphic to an induced
The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent
7. That is, every seven-edge subgraph of K3,3 contains a 4-cycle K2,2, but there ex
r a connected graph G, a spanning tree T is a subgraph of G with the least number of edges that stil
it is one of the connected components of the subgraph of G formed by repeatedly deleting all vertic
A k-core of a graph G is a maximal connected subgraph of G in which all vertices have degree at lea
The Gabriel graph is a subgraph of the Delaunay triangulation; it can be foun
greedy algorithm for G, but for every induced subgraph of G.
r equal to N. The K-MST does not have to be a subgraph of the minimum spanning tree (MST).
weak dual of an embedded planar graph is the subgraph of the dual graph whose vertices correspond t
ial case of finding a long path as an induced subgraph of a hypercube has been particularly well-stu
A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph construc
nts in the plane or any higher dimension is a subgraph of the Delaunay triangulation and the Gabriel
condition is imposed, the NNG is a forest, a subgraph of the Euclidean minimum spanning tree.
colour class in a defective coloring forms a subgraph of degree at most d.
G1 is isomorphic to an induced subgraph of G2 if there is an injective function f whi
nd positive if not in G. Conversely, G is the subgraph of Σ that consists of all vertices and all ne
ther we are able to reverse a coloration on a subgraph of G24 and paint V with, say, color number 2,
is at most two if and only if the graph is a subgraph of a planar graph with a Hamiltonian cycle; f
hs in F; for instance, every finite tree is a subgraph of a sufficiently large hypercube graph so a
ach possible constant-order graph occurs as a subgraph of a Paley graph is (in the limit for large q
least one of the subsets contains a complete subgraph on α vertices, for every α < ω1.
A graph G, with an overfull subgraph S such that , is of Class 2.
alternate, stricter definition of an overfull subgraph S of a graph G requires .
work theory, a giant component is a connected subgraph that contains a majority of the entire graph'
r rectangle is used to group variables into a subgraph that repeat together, and a number is drawn o
ges and vertices in which the largest induced subgraph that is a tree is as small as possible.
s planar if and only if it does not contain a subgraph that is a subdivision of K5 (the complete gra
trivially perfect graphs (in every induced subgraph the size of the largest independent set equal
The Gabriel graph contains as a subgraph the Euclidean minimum spanning tree, the rela
constant times the number of vertices in any subgraph), the maximum clique has bounded size and may
he same as the problem of finding a bipartite subgraph with the most edges.
its degeneracy plus one, since a clique is a subgraph with degree κ − 1.
The remaining edges of P1 and P2 form a subgraph with two outgoing edges at s, two incoming ed
h clique that it contains, is to examine each subgraph with at least k vertices and check to see whe