anarboricity

释义与例句

n.
  1. 1.

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

    不可数 数学

词源

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.

来源：wiktionary