All the solutions of the equation ∑i=1111xi=1 in distinct integers of the form xi∈3α5β7γxi∈3α5β7γ Fulltext Access 7 Pages 2008
The number of vertices of degree 7 in a contraction-critical 7-connected graph Fulltext Access 7 Pages 2008
Graphic sequences with a realization containing a generalized friendship graph Fulltext Access 7 Pages 2008
Binary operations derived from symmetric permutation sets and applications to absolute geometry Fulltext Access 7 Pages 2008
PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5,2)PG(5,2) Fulltext Access 7 Pages 2008
Queen's domination using border squares and (A,B)(A,B)-restricted domination Fulltext Access 7 Pages 2008
On semicomplete multipartite digraphs whose king sets are semicomplete digraphs Fulltext Access 7 Pages 2008
Classification of partitions of all triples on ten points into copies of Fano and affine planes Fulltext Access 7 Pages 2008
Matrices with maximum kth local exponent in the class of doubly symmetric primitive matrices Fulltext Access 7 Pages 2008
A best on-line algorithm for single machine scheduling with small delivery times Fulltext Access 7 Pages 2008
Single machine scheduling with release dates and job delivery to minimize the makespan Fulltext Access 7 Pages 2008
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan Fulltext Access 7 Pages 2008
Inverse min–max spanning tree problem under the Weighted sum-type Hamming distance Fulltext Access 7 Pages 2008
A series of slowly synchronizing automata with a zero state over a small alphabet Fulltext Access 7 Pages 2008
On the geodetic number and related metric sets in Cartesian product graphs Fulltext Access 7 Pages 2008
Choice number of complete multipartite graphs K3∗3,2∗(k−5),1∗2K3∗3,2∗(k−5),1∗2 and K4,3∗2,2∗(k−6),1∗3K4,3∗2,2∗(k−6),1∗3 Fulltext Access 7 Pages 2008
On generalized θθ-graphs whose second largest eigenvalue does not exceed 1 Fulltext Access 7 Pages 2008
Lattice path encodings in a combinatorial proof of a differential identity Fulltext Access 7 Pages 2008
The minimum number of vertices for a triangle-free graph with χl(G)=4χl(G)=4 is 11 Fulltext Access 7 Pages 2008