The Ramsey number for a cycle of length six versus a clique of order eight Fulltext Access 5 Pages 2009
A non-existence result on cyclic cycle-decompositions of the cocktail party graph Fulltext Access 5 Pages 2009
Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete Fulltext Access 5 Pages 2009
The competition number of a graph with exactly hh holes, all of which are independent Fulltext Access 5 Pages 2009
A degree sum condition with connectivity for relative length of longest paths and cycles Fulltext Access 5 Pages 2009
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2 Fulltext Access 5 Pages 2009
A note on minimizing makespan on a single batch processing machine with nonidentical job sizes Fulltext Access 5 Pages 2009
A note on the lower bound of centralized radio broadcasting for planar reachability graphs Fulltext Access 5 Pages 2009
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT Fulltext Access 5 Pages 2009
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees Fulltext Access 5 Pages 2009
On the existence of symmetric chain decompositions in a quotient of the Boolean lattice Fulltext Access 6 Pages 2009
Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity Fulltext Access 6 Pages 2009
From graceful labellings of paths to cyclic solutions of the Oberwolfach problem Fulltext Access 6 Pages 2009
On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset Fulltext Access 6 Pages 2009
On the chromaticity of complete multipartite graphs with certain edges added Fulltext Access 6 Pages 2009
The minimum number of ee-vertex-covers among hypergraphs with ee edges of given ranks Fulltext Access 6 Pages 2009
Listing minimal edge-covers of intersecting families with applications to connectivity problems Fulltext Access 6 Pages 2009
Upper bounds of degree 3 for the probability of the union of events via linear programming Fulltext Access 6 Pages 2009
Upper bounds on the kk-domination number and the kk-Roman domination number Fulltext Access 6 Pages 2009
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints Fulltext Access 6 Pages 2009
Scheduling jobs with release dates on parallel batch processing machines Fulltext Access 6 Pages 2009