Title of article :
Nonhamiltonian Triangulations with Large Connectivity and Representativity
Archdeacon، نويسنده , , Dan and Hartsfield، نويسنده , , Nora and Little، نويسنده , , C.H.C.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
In this paper we show that for eachnthere is a triangulation of an orientable surface which isn-connected,n-representative, and such that every spanning tree contains a vertex of degree at leastn. This also shows that there exist such graphs where any spanning walk must visit some vertex at leastntimes. We show the analogous results for nonorientable surfaces.
Journal title :
Journal of Combinatorial Theory Series B