「VERTEX」の共起表現一覧(2語右が「in」)
該当件数 : 16件
| S is a | vertex separator in G. |
| . Razgon : Computing Minimum Directed Feedback | Vertex Set in O*(1.9977n). |
| That is, every | vertex lies in the tree, but no cycles (or loops) are |
| Take U as the | vertex set in the hypergraph, and V as set of edges. |
| raph theory, an acyclic coloring is a (proper) | vertex coloring in which every 2-chromatic subgraph i |
| e the multigraph formed by adding a single new | vertex v in the unbounded face of G, and connecting v |
| simultaneously computes the distances to each | vertex t in the graphs Gt, it is also possible to fin |
| If the two removed edges meet at a | vertex, as in Figure B, the remaining graph contains |
| are trees directed towards the root at a fixed | vertex w in G. |
| graph theory, an exact coloring is a (proper) | vertex coloring in which every pair of colors appears |
| hich also has 3 triangles and two squares on a | vertex, but in a different order. |
| ertices in S is connected by an edge and every | vertex not in S is missing an edge to at least one ve |
| harmonious coloring in the sense that it is a | vertex coloring in which every pair of colors appears |
| cs, a star coloring of a graph G is a (proper) | vertex coloring in which every path on four vertices |
| First, a distance sequence from a | vertex v in a graph is the sequence n1, n2, n3, ..., |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
