Title of article
Embedding handcuffed designs in D-designs, where D is the triangle with attached edge Original Research Article
Author/Authors
Gaetano Quattrocchi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
22
From page
413
To page
434
Abstract
Let D be the triangle with attached edge (i.e. D is the graph having vertices {a0,a1,a2,a3} and edges {a0,a1}, {a0,a2}, {a1,a2}, {a0,a3}). Bermond and Schönheim (Discrete Math. 19 (1977) 113) proved that a D-design of order n exists if and only if n≡0 or 1 (mod 8). Let (W,C) be a nontrivial D-design of order n, n⩾8, and let V⊂W, |V|=v
Keywords
Graph design , Embedding , Path
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949490
Link To Document