Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude Fulltext Access 9 Pages 2016
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs Fulltext Access 9 Pages 2016
Lift-and-project ranks of the stable set polytope of joined aa-perfect graphs Fulltext Access 9 Pages 2016
Conjectured bounds for the sum of squares of positive eigenvalues of a graph Fulltext Access 9 Pages 2016
Strong resolving partitions for strong product graphs and Cartesian product graphs Fulltext Access 9 Pages 2016
On class dimension of flat association schemes in affine and affine-symplectic spaces Fulltext Access 9 Pages 2016
Various constructions for self-dual codes over rings and new binary self-dual codes Fulltext Access 10 Pages 2016
Approximation of the parallel machine scheduling problem with additional unit resources Fulltext Access 10 Pages 2016
Existentially closed graphs via permutation polynomials over finite fields Fulltext Access 10 Pages 2016
Asymptotic enumeration of sparse uniform hypergraphs with given degrees Fulltext Access 10 Pages 2016
Minimum strictly fundamental cycle bases of planar graphs are hard to find Fulltext Access 10 Pages 2016
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs Fulltext Access 10 Pages 2016
The sorting index and inversion number on order ideals of permutation groups Fulltext Access 10 Pages 2016
List vertex-arboricity of toroidal graphs without 44-cycles adjacent to 33-cycles Fulltext Access 10 Pages 2016
On automorphisms and structural properties of double generalized Petersen graphs Fulltext Access 10 Pages 2016
Coloring the square of graphs whose maximum average degree is less than 4 Fulltext Access 10 Pages 2016
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth Fulltext Access 10 Pages 2016
Linearity is strictly more powerful than contiguity for encoding graphs Fulltext Access 10 Pages 2016
There are no finite partial cubes of girth more than 6 and minimum degree at least 3 Fulltext Access 11 Pages 2016
The (1,2)(1,2)-step competition graph of a pure local tournament that is not round decomposable Fulltext Access 11 Pages 2016
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem Fulltext Access 11 Pages 2016
On three polynomial kernels of sequences for arbitrarily partitionable graphs Fulltext Access 11 Pages 2016
Planar graphs without adjacent cycles of length at most five are (1,1,0) -colorable Fulltext Access 11 Pages 2016
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems Fulltext Access 11 Pages 2016
Mixed-integer linear programming heuristics for the prepack optimization problem Fulltext Access 11 Pages 2016
Subexponential fixed-parameter algorithms for partial vector domination Fulltext Access 11 Pages 2016
Scheduling jobs with equal processing times and a single server on parallel identical machines Fulltext Access 11 Pages 2016
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 Fulltext Access 11 Pages 2016
Improved bounds on the partitioning of the Boolean lattice into chains of equal size Fulltext Access 11 Pages 2016
Relation between the skew-rank of an oriented graph and the rank of its underlying graph Fulltext Access 11 Pages 2016