On choosability with separation of planar graphs with lists of different sizes Fulltext Access 5 Pages 2015
Cycle double covers containing certain circuits in cubic graphs having special structures Fulltext Access 5 Pages 2015
On a relation between the atom-bond connectivity and the first geometric–arithmetic indices Fulltext Access 5 Pages 2015
Characterization of rotation words generated by homeomorphisms on a circle Fulltext Access 5 Pages 2015
A characterization of the non-trivial diameter two graphs of minimum size Fulltext Access 5 Pages 2015
A graph-theoretic approach for comparing dimensions of components in simply-graded algebras Fulltext Access 5 Pages 2015
Cartesian product of two symmetric starter vectors of orthogonal double covers Fulltext Access 5 Pages 2015
Note on the spanning-tree packing number of lexicographic product graphs Fulltext Access 5 Pages 2015
On the nonvanishing of representation functions of some special sequences Fulltext Access 5 Pages 2015
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges Fulltext Access 6 Pages 2015
New error-correcting pooling designs with vector spaces over finite field Fulltext Access 6 Pages 2015
Congruences for the number of partitions and bipartitions with distinct even parts Fulltext Access 6 Pages 2015
Recursion orders for weights of Boolean cubic rotation symmetric functions Fulltext Access 6 Pages 2015
Degree sequence realizations with given packing and covering of spanning trees Fulltext Access 6 Pages 2015
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines Fulltext Access 6 Pages 2015
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs Fulltext Access 6 Pages 2015
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size Fulltext Access 6 Pages 2015
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs Fulltext Access 6 Pages 2015
Revisiting a randomized algorithm for the minimum rainbow subgraph problem Fulltext Access 6 Pages 2015
Improving results on the pseudorandomness of sequences generated via the additive order of a finite field Fulltext Access 6 Pages 2015
Stupid is as Stupid Does: Taking the Square Root of the Square of a Floating-Point Number Fulltext Access 6 Pages 2015
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem Fulltext Access 7 Pages 2015
Decomposition of circulant digraphs with two jumps into cycles of equal lengths Fulltext Access 7 Pages 2015