In 1992 (or thereabouts) Bloch and Kriz gave the first explicit definition of the category of mixed Tate motives (MTM). Their definition relies heavily on the theory of algebraic cycles. Unfortunately, traditional methods of representing algebraic cycles (such as in terms of formal linear combinations of systems of polynomial equations) are notoriously difficult to work with, so progress in capitalizing on this description of the category to illuminate outstanding conjectures in the field has been slow. More recently, Gangl, Goncharov, and Levin suggested a simpler way to understand this category (and by extension, algebraic cycles more generally) by relating specific algebraic cycles to rooted, decorated, planar trees. In our talks, describing work in progress, we generalize this correspondence and attempt to systematize the connection between algebraic cycles and graphs. We will construct a Lie coalgebra L from a certain algebra of admissible graphs, discuss various properties that it satisfies (such as a well defined and simply described realization functor to the category of mixed Hodge structures), and relate the category of co-representations of L to the category MTM. One promising consequence of our investigations is the appearance of alternative bases of rational motives that have not previously appeared in the literature, suggesting a richer rational structure than had been previously suspected. In addition, our results give the first bounds on the complexity of computing admissibility of algebraic cycles, a previously unexplored topic.