Buscar
Mostrando ítems 1-10 de 227
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
(Wiley-Liss Inc., 2019)
© 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 ...
Partitioning infinite hypergraphs into few monochromatic berge-paths
(Springer, 2020)
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 ...
Linial’s Conjecture for Arc-spine Digraphs
(Revista Eletrônica de Iniciação Científica em Computação, 2019)
A semiclassical trace formula for the canonical partition function of one-dimensional systems
(Elsevier Science BvAmsterdamHolanda, 2007)
On Linial's Conjecture For Spine Digraphs
(Elsevier Science BVAmsterdam, 2017)
Partições de digrafos em caminhosPath partitions in digraphs
([s.n.], 2013)
New Two-Line Arrays Representing Partitions
(Birkhauser Verlag AgBaselSuíça, 2011)
Convex p-partitions of bipartite graphs
(Elsevier, 2016)
A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets ...