Title of article
High girth and extendability Original Research Article
Author/Authors
Pavol Gvozdjak، نويسنده , , Jaroslav Ne?et?il، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
8
From page
77
To page
84
Abstract
In this paper, we present a construction of graphs Gk,n which have girth at least n and for which every matching of size k may be extended to a perfect matching of Gk,n. This also yields a new construction of graphs with a given edge-density and girth.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943838
Link To Document