Resolvable group divisible designs with block size four and general index Fulltext Access 8 Pages 2009
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps Fulltext Access 8 Pages 2009
Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five Fulltext Access 8 Pages 2009
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles Fulltext Access 8 Pages 2009
An upper bound on the domination number of a graph with minimum degree 2 Fulltext Access 8 Pages 2009
Indecomposability graph and critical vertices of an indecomposable graph Fulltext Access 8 Pages 2009
On the complexity of SNP block partitioning under the perfect phylogeny model Fulltext Access 8 Pages 2009
Generalizations of Świerczkowski’s lemma and the arity gap of finite functions Fulltext Access 8 Pages 2009
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph Fulltext Access 9 Pages 2009
On the intersection of distance-jj-ovoids and subpolygons of generalized polygons Fulltext Access 9 Pages 2009
A characterization of λd,1λd,1-minimal trees and other attainable classes Fulltext Access 9 Pages 2009
A construction of dzdz-disjunct matrices by orthogonal space and discussion on their design parameters Fulltext Access 9 Pages 2009
Total colorings and list total colorings of planar graphs without intersecting 4-cycles Fulltext Access 9 Pages 2009
Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles Fulltext Access 9 Pages 2009
Degree condition for the existence of a kk-factor containing a given Hamiltonian cycle Fulltext Access 9 Pages 2009
First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph Fulltext Access 9 Pages 2009
Undirected simple connected graphs with minimum number of spanning trees Fulltext Access 9 Pages 2009