anarboricity
anarboricity noun: the maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.
Noun
anarboricity (uncountable)
- The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.
- Antonyms:
- arboricity
Antonyms of anarboricity
Origin of anarboricity
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.
Questions about anarboricity
- What does anarboricity mean?
- Anarboricity means the maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G.
- What part of speech is anarboricity?
- Anarboricity is a noun.
Words near anarboricity in the dictionary
Source and license
Adapted from Wiktionary: anarboricity (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “anarboricity.” Word.ws, https://word.ws/anarboricity. Based on Wiktionary, CC BY-SA 4.0.
