Corrigendum to “enumerating permutation polynomials-I: Permutations with non-maximal degree” Fulltext Access 4 Pages 2007
Infinite families of (n+1)-dichromatic vertex critical circulant tournaments Fulltext Access 4 Pages 2007
Colorings of k-balanced matrices and integer decomposition property of related polyhedra Fulltext Access 4 Pages 2007
Corrigendum to “On zero-divisor graphs of small finite commutative rings”: [Discrete Math. 307 (2007) 1155–1166] Fulltext Access 4 Pages 2007
Each maximal planar graph with exactly two separating triangles is Hamiltonian Fulltext Access 4 Pages 2007
Generalizations of Khovanskiĭ's theorem on growth of sumsets in abelian semigroups: (extended abstract) Fulltext Access 4 Pages 2007
On the Chromatic Numbers of R2 and R3 with Intervals of Forbidden Distances Fulltext Access 4 Pages 2007
Degree conditions for hamiltonicity: Counting the number of missing edges Fulltext Access 5 Pages 2007
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks Fulltext Access 5 Pages 2007
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs Fulltext Access 5 Pages 2007
On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous Fulltext Access 5 Pages 2007
A policy improvement method for constrained average Markov decision processes Fulltext Access 5 Pages 2007
An Eclipse-based Integrated Environment for Developing Executable Structural Operational Semantics Specifications Fulltext Access 5 Pages 2007
Every toroidal graph without adjacent triangles is (4,1)*(4,1)*-choosable Fulltext Access 5 Pages 2007
A correct proof of the McMorris–Powers’ theorem on the consensus of phylogenies Fulltext Access 5 Pages 2007
On a bound of Garcia and Voloch for the number of points of a Fermat curve over a prime field Fulltext Access 5 Pages 2007
The Erdős–Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces Fulltext Access 5 Pages 2007
On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem Fulltext Access 5 Pages 2007
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP Fulltext Access 5 Pages 2007