Title of article
On the shortness exponent of 1-tough, maximal planar graphs
Author/Authors
Michal Tk??، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
8
From page
321
To page
328
Abstract
It is shown that the shortness exponent of the class of 1-tough, maximal planar graphs is at most log6 5. The non-Hamiltonian, 1-tough, maximal planar graph with a minimum number of vertices is presented.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943863
Link To Document