A geometric construction of a (38,2)(38,2)-blocking set in PG(2,13)PG(2,13) and the related [145,3,133]13[145,3,133]13 code Fulltext Access 5 Pages 2008
Resolvable 4-cycle group divisible designs with two associate classes: Part size even Fulltext Access 5 Pages 2008
Construction of optimal ternary constant weight codes via Bhaskar Rao designs Fulltext Access 5 Pages 2008
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs Fulltext Access 5 Pages 2008
Covering planar graphs with forests, one having a bounded maximum degree Fulltext Access 5 Pages 2008
Regular hamiltonian embeddings of Kn,nKn,n and regular triangular embeddings of Kn,n,nKn,n,n Fulltext Access 5 Pages 2008
Trees with extremal numbers of maximal independent sets including the set of leaves Fulltext Access 5 Pages 2008
A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes Fulltext Access 5 Pages 2008
Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness Fulltext Access 5 Pages 2008
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Fulltext Access 5 Pages 2008
Strong oriented chromatic number of planar graphs without cycles of specific lengths Fulltext Access 6 Pages 2008
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs Fulltext Access 6 Pages 2008
Sufficient conditions for a graph to be edge-colorable with maximum degree colors 1 Fulltext Access 6 Pages 2008