[HTML][HTML] Dynamic chromatic number of regular graphs
M Alishahi - Discrete applied mathematics, 2012 - Elsevier
A k-dynamic coloring of a graph G is a proper coloring of G with k colors such that for every
vertex v∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. The …
vertex v∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. The …
[HTML][HTML] Tropical dominating sets in vertex-coloured graphs
JAA d'Auriac, C Bujtás, A El Maftouhi… - Journal of Discrete …, 2018 - Elsevier
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 sets …
graph appears at least once in the set. Here, we study minimum tropical dominating sets …
Tropical matchings in vertex-colored graphs
A subgraph of a vertex-colored graph is said to be tropical whenever it contains all colors of
the original graph. In this work we study the problem of finding, if any, maximum tropical …
the original graph. In this work we study the problem of finding, if any, maximum tropical …
Tropical paths in vertex-colored graphs
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color
of the initial graph. In this work we study the problem of finding tropical paths in vertex …
of the initial graph. In this work we study the problem of finding tropical paths in vertex …
Connected tropical subgraphs in vertex-colored graphs
JAA d'Auriac, N Cohen, H El Mafthoui… - Discrete …, 2016 - dmtcs.episciences.org
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color
of the graph. In this work we study the problem of finding a minimal connected tropical …
of the graph. In this work we study the problem of finding a minimal connected tropical …
[HTML][HTML] Shortest paths with exclusive-disjunction arc pairs conflicts
In this paper, a NP-hard variant of the shortest path problem, involving exclusive-disjunction
arc pairs conflicts, is introduced. In this framework, a conflict is violated and a penalty has to …
arc pairs conflicts, is introduced. In this framework, a conflict is violated and a penalty has to …
Rainbow paths with prescribed ends
It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex
coloring of graphs. Preprint] that, if G is a connected graph distinct from C-7, then there is a …
coloring of graphs. Preprint] that, if G is a connected graph distinct from C-7, then there is a …
Maximum colorful independent sets in vertex-colored graphs
Y Manoussakis, HP Pham - Electronic Notes in Discrete Mathematics, 2018 - Elsevier
In this paper we study the problem of finding a maximum colorful independent set in vertex-
colored graphs. Specifically, given a graph with colored vertices, we wish to find an …
colored graphs. Specifically, given a graph with colored vertices, we wish to find an …
Maximum colorful cliques in vertex-colored graphs
GF Italiano, Y Manoussakis, N Kim Thang… - … Qing Dao, China, July 2-4 …, 2018 - Springer
In this paper we study the problem of finding a maximum colorful clique in vertex-colored
graphs. Specifically, given a graph with colored vertices, we wish to find a clique containing …
graphs. Specifically, given a graph with colored vertices, we wish to find a clique containing …
Tropical paths in vertex-colored graphs
J Cohen, GF Italiano, Y Manoussakis… - … and Applications: 11th …, 2017 - Springer
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color
of the initial graph. In this work we study the problem of finding tropical paths in vertex …
of the initial graph. In this work we study the problem of finding tropical paths in vertex …