We model interfaces between immiscible fluids as cost-mini\-mizing networks, where ``cost'' is a weighted length. We consider conjectured necessary and sufficient conditions for when a planar cone is minimizing. In some cases we give a proof; in other cases we provide a counterexample.