Graph Theory Proof: "An undirected finite graph G is bipartite if and only if it contains no cycles of odd length" MathematicsMillerMarch 3, 2016University of Colorado DenverMathematics, Graph Theory, Proofcraft, Project Management, All ProjectsComment
n-Balls: A Multi-Dimensional Analysis of Spherical Structures with Volume MathematicsMillerDecember 4, 2013University of Colorado DenverMathematics, Calculus, Project Management, All ProjectsComment
Terminal Velocity: A Differential Analysis MathematicsMillerMay 8, 2013University of Colorado DenverMathematics, Calculus, Differential Equations, All ProjectsComment
