11 citations · 14 across the 4 of their papers we have counts for
6 papers
On the number of vertex-disjoint cycles in digraphs
Yandong Bai, Yannis Manoussakis
Let be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least contains vertex-disjoint cycles. It is famous…
The complexity of tropical graph homomorphisms
Florent Foucaud, Ararat Harutyunyan, Pavol Hell +3
A tropical graph consists of a graph and a (not necessarily proper) vertex-colouring of . Given two tropical graphs and , a homomorphism of $(G,…
Tropical Dominating Sets in Vertex-Coloured Graphs
J. -A. Angles d'Auriac, Cs. Bujtas, A. El Maftouhi +7
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating set…
Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Raquel Águeda, Valentin Borozan, Raquel Díaz +2
A -edge-colored multigraph has each edge colored with one of the available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle contai…
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Raquel Águeda, Valentin Borozan, Marina Groshaus +3
Given a -edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In…
Partitioning a graph into highly connected subgraphs
Valentin Borozan, Michael Ferrara, Shinya Fujita +4
Given , a -proper partition of a graph is a partition of such that each part of induces a -connected subgraph of . We…