Finding Paths between Graph Colourings: Computational Complexity and Possible Distances Fulltext Access 7 Pages 2007
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids Fulltext Access 7 Pages 2007
Triangular embeddings of complete graphs from graceful labellings of paths Fulltext Access 7 Pages 2007
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture Fulltext Access 7 Pages 2007
On the number of irreducible modular representations of a PP and QQ polynomial scheme Fulltext Access 7 Pages 2007
The minimum length of a base for the symmetric group acting on partitions Fulltext Access 7 Pages 2007
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven Fulltext Access 7 Pages 2007
Nonexistence of near-extremal formally self-dual even codes of length divisible by 8 Fulltext Access 7 Pages 2007
A note on worst-case performance of heuristics for maintenance scheduling problems Fulltext Access 7 Pages 2007
Construction of universal one-way hash functions: Tree hashing revisited Fulltext Access 7 Pages 2007
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs Fulltext Access 7 Pages 2007
A quadratic distance bound on sliding between crossing-free spanning trees Fulltext Access 7 Pages 2007
Some results in square-free and strong square-free edge-colorings of graphs Fulltext Access 7 Pages 2007