<span class="searchmatch">subgraphs</span> plural of <span class="searchmatch">subgraph</span> Hapsburgs...
article on: Glossary of graph theory Wikipedia From sub- + graph. <span class="searchmatch">subgraph</span> (plural <span class="searchmatch">subgraphs</span>) (graph theory) A graph or network that makes up part of a larger...
thickness. outerthickness (plural outerthicknesses) (graph theory) The minimum number of outerplanar <span class="searchmatch">subgraphs</span> which a given graph can decompose into....
Connections between cardinality of infinite graphs and cardinalities of certain <span class="searchmatch">subgraphs</span>, with a simple structure, contained in the former, which determine the...
(plural strongly connected components) (graph theory) Given a directed graph, a maximal strongly connected <span class="searchmatch">subgraph</span>. connected component partition <span class="searchmatch">subgraph</span>...
quasi- + separable. quasiseparable (not comparable) (mathematics, of a graph) That becomes disconnected when a suitable <span class="searchmatch">subgraph</span> is removed nonseparable...
From pod- + graf. IPA(key): [ˈpodɡraf] podgraf m inan <span class="searchmatch">subgraph</span> Declension of podgraf (hard masculine inanimate)...
From sub- + forest. subforest (plural subforests) (mathematics) A <span class="searchmatch">subgraph</span> that is a forest. F is a subforest of the tree T....