Buscar
Mostrando ítems 1-10 de 308
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 ...
Strong cliques and equistability of EPT graphs
(Elsevier Science, 2016-04)
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-intersection graphs of paths in a tree. This result generalizes a previously known characterization of equistable line graphs. ...
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 ...
Finding H-partitions efficiently
(E D P SciencesLes Ulis Cedex AFrança, 2005)
The Graph Sandwich Problem for P-4-sparse graphs
(Elsevier Science BvAmsterdamHolanda, 2009)
Partitioning chordal graphs into independent sets and cliques
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Complexity of the cluster deletion problem on subclasses of chordal graphs
(Elsevier Science, 2015-10)
We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to ...