Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks Fulltext Access 14 Pages 2008
A special class of tensor categories initiated by inverse braid monoids Fulltext Access 14 Pages 2008
Geometric graphs which are 1-skeletons of unstacked triangulated polygons Fulltext Access 14 Pages 2008
On realizations of point determining graphs, and obstructions to full homomorphisms Fulltext Access 14 Pages 2008
Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic ϵ∈{−1,−2,−3} Fulltext Access 14 Pages 2008
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs Fulltext Access 14 Pages 2008
Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency Fulltext Access 14 Pages 2008
A Schur function identity related to the (−1)-enumeration of self-complementary plane partitions Fulltext Access 14 Pages 2008
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency Fulltext Access 14 Pages 2008
A symbolic operator approach to several summation formulas for power series II Fulltext Access 14 Pages 2008
On some colouring of 4-cycle systems with specified block colour patterns Fulltext Access 14 Pages 2008
When is a partial Latin square uniquely completable, but not its completable product? Fulltext Access 14 Pages 2008
Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs Fulltext Access 14 Pages 2008
A 3-approximation algorithm for the subtree distance between phylogenies Fulltext Access 14 Pages 2008
On the roots of independence polynomials of almost all very well-covered graphs Fulltext Access 14 Pages 2008
Stochastic applications of media theory: Random walks on weak orders or partial orders Fulltext Access 14 Pages 2008
Approximations of Lovász extensions and their induced interaction index Fulltext Access 14 Pages 2008
A continuous approach for the concave cost supply problem via DC programming and DCA Fulltext Access 14 Pages 2008
A sequential elimination algorithm for computing bounds on the clique number of a graph Fulltext Access 14 Pages 2008
Rotation symmetric Boolean functions—Count and cryptographic properties Fulltext Access 14 Pages 2008
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Fulltext Access 14 Pages 2008
Ribbon tableaux, ribbon rigged configurations and Hall–Littlewood functions at roots of unity Fulltext Access 15 Pages 2008
The structure of the spin-embeddings of dual polar spaces and related geometries Fulltext Access 15 Pages 2008
Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 Fulltext Access 15 Pages 2008
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times Fulltext Access 15 Pages 2008
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability Fulltext Access 15 Pages 2008
Number of points on certain hyperelliptic curves defined over finite fields Fulltext Access 15 Pages 2008
Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fields Fulltext Access 15 Pages 2008