directed acyclic graph
acyclic digraph
tree
Bethe lattice
forest
hole
graph hole
Veblen's theorem
pseudoforest
sparsifier
decycling
noneven
polytree
cage
empty graph
subdrawing
undirected graph
directed
Robertson-Seymour theorem
hypohamiltonian
anticycle
Herschel graph
pseudodigraph
tournament
circuit rank
Floyd-Warshall algorithm
Menger's theorem
chordal
antiregular
bouquet of circles
Steiner tree
wedge of circles
rose
protograph
pseudo-edge
digraph
undirected path
altermatic
pseudograph
cyclomatic
dominating set
hypernode
graph-theoretically
ultrasparsifier
nontree
graphable
Borůvka's algorithm
comdag
triangle-free
rectagraph
adjacency list
cocktail party graph
chart
dominate
bidirected
cycle chord
sparkline
polynema
Chinese postman problem
multitree
semi-transitive
polygraph
digraphon
chromatic number
graphette
Bayesian network
independent set
de Bruijn-Erdős theorem
Bellman-Ford algorithm
distribution curve
girth
turning point
adinkra
directed edge
Eppstein's algorithm
bridge
diagram
boxicity
flow network
snark
planar graph
plumbago
graphotactically
cubic graph
transiso
line graph
weighted graph
order
graphetically
biclique
biconnected
degree sequence
graph
plane tree
rotation
cluster state

English words for 'A finite directed graph that contains no directed cycles.'

As you may have noticed, above you will find words for "A finite directed graph that contains no directed cycles.". 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