Robertson-Seymour theorem
graph-theoretically
melonic
subdrawing
tournament
directed graph
Kruskal's tree theorem
pluperfection
bidirected
acyclic digraph
directed acyclic graph
algebraic graph theory
graphotactic
local minimum
Veblen's theorem
sparsifier
hypernode
dominating set
graph toughness
undirected path
undirected graph
cocktail party graph
Ore's theorem
pseudo-edge
triangle-free
pseudodigraph
tree
graphetically
de Bruijn-Erdős theorem
pluperfect
edge list
Turán's theorem
graph antihole
sofic
forest
degree sequence
cyclomatic
Menger's theorem
nonblocker
reachability
metanode
Herschel graph
polytree
cubic graph
strongly connected component
Whitney's theorem
directed
graph theory
grapholectal
cage
ultrasparsifier
boxicity
vertex
cluster state
Ramsey's theorem
anticycle
metaconjecture
graphonomy
dismantlable
decycling
graphette
Zermelo's theorem
graphotactically
semantic network
utility graph
independent set
plane tree
digraph
digraphon
isthmus
altermatic
Steiner tree
pseudoforest
flatline
independence number
order
graphlike
flow network
hypohamiltonian
graphemically
clique number
hole
assortativity
collider
diameter
semi-transitive
planar graph
graphenic
graphological
graphologic
crown graph
regular graph
size
subgraph
plumbago
ultragraph

English words for 'A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.'

As you may have noticed, above you will find words for "A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries