The main results of this paper are the discovery of infinite families of flow equivalent pairs of and , amalamorphs, and infinite families of chromatically equivalent pairs of and ; homeomorphs, where is with one edge deleted, is the Prism graph, and is the join of and a cycle on 4 vertices. Six families of amalamorphs, with two families having 6 parameters, and 9 families of amalamorphs, with one family having 4 parameters, are discovered. Since and are both planar, all these results obtained can be stated in terms of chromatically equivalent pairs of and homeomorphs. Also, three conjectures are made about the non-existence of flow-equivalent amalamorphs or chromatically equivalent homeomorphs of certain graphs.