Solution of the conjecture: If n≡0(mod4), n>4n>4, then KnKn has a super vertex-magic total labeling Fulltext Access 10 Pages 2007
The complexity of assigning genotypes to people in a pedigree consistently Fulltext Access 10 Pages 2007
Reconstructing graphs from size and degree properties of their induced k-subgraphs Fulltext Access 10 Pages 2007
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs Fulltext Access 10 Pages 2007
A generalization of the pentomino exclusion problem: Dislocation of graphs Fulltext Access 10 Pages 2007
Factor versus palindromic complexity of uniformly recurrent infinite words Fulltext Access 10 Pages 2007
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups Fulltext Access 10 Pages 2007
Some approximation algorithms for the clique partition problem in weighted interval graphs Fulltext Access 10 Pages 2007
Faster algorithms for finding lowest common ancestors in directed acyclic graphs Fulltext Access 10 Pages 2007
Approximating the maximum clique minor and some subgraph homeomorphism problems Fulltext Access 10 Pages 2007
Autopoietic automata: Complexity issues in offspring-producing evolving processes Fulltext Access 10 Pages 2007
Partitioning multi-dimensional sets in a small number of “uniform” parts Fulltext Access 11 Pages 2007
The hyperplanes of DQ(2n,K) and DQ−(2n+1,q) which arise from their spin-embeddings Fulltext Access 11 Pages 2007
BCH codes and distance multi- or fractional colorings in hypercubes asymptotically Fulltext Access 11 Pages 2007
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements Fulltext Access 11 Pages 2007
On the number of components for some parallel communicating grammar systems Fulltext Access 11 Pages 2007
Using well-structured transition systems to decide divergence for catalytic P systems Fulltext Access 11 Pages 2007
New applications of clique separator decomposition for the Maximum Weight Stable Set problem Fulltext Access 11 Pages 2007
Complementation of rational sets on scattered linear orderings of finite rank Fulltext Access 11 Pages 2007
Characterizing defect nn-extendable bipartite graphs with different connectivities Fulltext Access 11 Pages 2007
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests Fulltext Access 11 Pages 2007
(d,1)(d,1)-total labelling of planar graphs with large girth and high maximum degree Fulltext Access 11 Pages 2007
γγ-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent Fulltext Access 11 Pages 2007
Extremal cardinalities for identifying and locating-dominating codes in graphs Fulltext Access 11 Pages 2007