Title of article
On short cycles through prescribed vertices of a graph Original Research Article
Author/Authors
F. G?ring، نويسنده , , J. Harant، نويسنده , , E. Hexel، نويسنده , , Zs. Tuza، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
67
To page
74
Abstract
For c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k prescribed vertices of a c-connected graph are proved. Analogous results on planar graphs are presented, too.
Keywords
Graph , Prescribed vertices , Short cycle
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
949029
Link To Document