© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...

Extending a result of Rado to hypergraphs, we prove that for all s,k,t is an element of N$$s, k, t \in {\mathbb {N}}$$\end{document} with k >= t >= 2 the vertices of every r=s(k-t+1)-edge-coloured countably infinite complete ...

In this paper, we give a unified treatment of two different definitions of complementarity partition of multifold conic programs introduced independently in Bonnans and Ramirez [Perturbation analysis of second-order cone ...

In this paper, we present a new approach for generic 3D shape retrieval based on a mesh partitioning scheme. Our method combines a mesh global description and mesh partition descriptions to represent a 3D shape. The ...