pith. sign in

arxiv: 1807.08079 · v2 · pith:AYGFJEABnew · submitted 2018-07-21 · 🧮 math.CO

How to Build a Graph in n Days: Some Variants on Graph Assembly

classification 🧮 math.CO
keywords assemblygraphbonatreevincearticleauthorsbuild
0
0 comments X
read the original abstract

In a recent article by M. Bona and A. Vince, the authors introduced the concept of an assembly tree for a graph. Assembly trees act as record keeping devices for the construction of a given graph from its vertices. In this paper we extend the work initiated by M. Bona and A. Vince as well as define and examine a more generalized definition of assembly tree.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.