anarboricity

A1N1A1R1B3O1R1I1C3I1T1Y4

noun

The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.

Opposite
Scrabble 19

Meanings

nounanarboricity (uncountable)
  1. uncountablegraph theoryThe maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.

    Antonyms: arboricity

Synonyms & antonyms

nounThe maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.

Opposite

Origin

From an- + arboricity. Coined by Ronald C. Read; the etymologically inaccurate Greek prefix an- was chosen to achieve a pun on the name of Ann Arbor, where the University of Michigan is based.

Full word history & related roots →
Cite this entry
APA

anarboricity. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/anarboricity

MLA

“anarboricity.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/anarboricity. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “anarboricity,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/anarboricity.

Source: anarboricity on Wiktionary, CC BY-SA 4.0.