Abstract
We solve a conjecture of Foulds and Robinson (1979) on decomposable triangulations in the plane, in the more general context of a decomposition theory of cubic 3-connected graphs. The decomposition gives us a natural way to obtain some known results about specific homeomorphic subgraphs and the extremal diameter of 3-connected cubic graphs.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call