Assertion: planar graph | /r/HasProperty | partitioned into two induced trees
Facets:
Source sentences:
text: In particular, Barnette's conjecture on the Hamiltonicity of cubic bipartite polyhedral graphs is equivalent to the conjecture that every Eulerian maximal planar graph can be partitioned into two induced trees.