Results 121 to 130 of about 1,904 (164)

Monochromatic Vertex-Disconnection Colorings of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
Let \(G\) be a vertex-coloured connected graph (adjacent vertices can be given the same colour). A subset \(U\) of the vertex-set of \(G\) is said to be monochromatic if all the vertices of \(U\) are assigned the same colour. The graph \(G\) is said to be monochromatic vertex-disconnected if, for a two distinct vertices \(x\) and \(y\), there is a ...
Yanhong Gao, Xueliang Li
openaire   +2 more sources

Interval vertex coloring

Applied Mathematics and Computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mária Maceková, Zuzana Šárošiová, Roman Soták   +2 more
openaire   +2 more sources

Uncertain vertex coloring problem

Soft Computing, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin, Peng, Jin, Ralescu, Dan A.
openaire   +2 more sources

Colorful path detection in vertex-colored temporal

Network Science, 2023
AbstractFinding paths is a fundamental problem in graph theory and algorithm design due to its many applications. Recently, this problem has been considered on temporal graphs, where edges may change over a discrete time domain. The analysis of graphs has also taken into account the relevance of vertex properties, modeled by assigning to vertices ...
Dondi, Riccardo, Hosseinzadeh, Mohammad Mehdi   +1 more
openaire   +3 more sources

Maximum Colorful Cycles in Vertex-Colored Graphs

2018
In this paper, we study the problem of finding a maximum colorful cycle a vertex-colored graph. Specifically, given a graph with colored vertices, the goal is to find a cycle containing the maximum number of colors. We aim to give a dichotomy overview on the complexity of the problem.
Italiano, Giuseppe, Manoussakis, Yannis, Kim Thang, Nguyen, Pham, Hong-Phong   +3 more
openaire   +3 more sources

Maximum Colorful Cliques in Vertex-Colored Graphs

2018
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 the maximum number of colors. Note that this problem is harder than the maximum clique problem, which can be obtained as a special case when each vertex has a different ...
Italiano, Giuseppe, Manoussakis, Yannis, Nguyen, Kim Thang, Pham, Hong-Phong   +3 more
openaire   +1 more source

Distributed Game-Theoretic Vertex Coloring

2010
We exploit the game-theoretic ideas presented in [12] to study the vertex coloring problem in a distributed setting. The vertices of the graph are seen as players in a suitably defined strategic game, where each player has to choose some color, and the payoff of a vertex is the total number of players that have chosen the same color as its own.
CHATZIGIANNAKIS, IOANNIS, Koninis, C., Panagopoulou, P. N., Spirakis, P. G.   +3 more
openaire   +1 more source

Tropical Paths in Vertex-Colored Graphs

Journal of Combinatorial Optimization, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cohen, Johanne, Italiano, Giuseppe F., Manoussakis, Yannis, Kim Thang, Nguyen, Pham, Phong, Pham, Hong-Phong   +5 more
openaire   +2 more sources

Vertex‐distinguishing edge colorings of graphs

Journal of Graph Theory, 2002
AbstractWe consider lower bounds on the the vertex‐distinguishing edge chromatic number of graphs and prove that these are compatible with a conjecture of Burris and Schelp 8. We also find upper bounds on this number for certain regular graphs G of low degree and hence verify the conjecture for a reasonably large class of such graphs.
Balister, P. N., Riordan, O. M., Schelp, R. H.   +2 more
openaire   +1 more source

Graceful Vertex Colorings

2016
In Chap. 2 and 3, we described two edge colorings that give rise to two vertex colorings, one in terms of sets of colors and the other in terms of multisets. Now, in this chapter and the next, the situation is reversed, as we describe vertex colorings that give rise to edge colorings.
openaire   +1 more source