Each maximal planar graph with exactly two separating triangles is Hamiltonian

Guido Helden. Each maximal planar graph with exactly two separating triangles is Hamiltonian. Discrete Applied Mathematics, 155(14):1833-1836, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.