Results 41 to 50 of about 33,621 (316)

Total Global Dominator Coloring of Trees and Unicyclic Graphs

مجلة بغداد للعلوم, 2023
          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class.
Chithra K. P., Joseph Mayamma
doaj   +1 more source

On facial unique-maximum (edge-)coloring [PDF]

, 2017
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna, Lidicky, Bernard, Lidicky, Bernard, Luzar, Borut, Skrekovski, Riste   +4 more
core   +3 more sources

Acyclic orientations with path constraints [PDF]

, 2005
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex ...
Bermond, Cid C. de Souza, Deming, Grötschel, Grötschel, Maniezzo, Nelson Maculan, Rosa M. V. Figueiredo, Valmir C. Barbosa   +8 more
core   +2 more sources

RECYCLING SOLUTIONS FOR VERTEX COLORING HEURISTICS

Journal of the Operations Research Society of Japan, 2021
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-colorability problem iteratively, decreasing k one by one. Whether a heuristic algorithm finds a legal k-coloring quickly or not is largely affected by an initial solution ...
Uchida, Yasutaka, Yajima, Kaito, Haraguchi, Kazuya   +2 more
openaire   +4 more sources

A Note on Coloring Vertex-Transitive Graphs [PDF]

The Electronic Journal of Combinatorics, 2015
We prove bounds on the chromatic number $\chi$ of a vertex-transitive graph in terms of its clique number $\omega$ and maximum degree $\Delta$. We conjecture that every vertex-transitive graph satisfies $\chi \le \max \{\omega, \left\lceil\frac{5\Delta + 3}{6}\right\rceil\}$, and we prove results supporting this conjecture.
Landon Rabern, Daniel W. Cranston
openaire   +3 more sources

Global Dominator Chromatic Number of Certain Graphs [PDF]

Mathematics Interdisciplinary Research
‎For a graph G=(V,E) and a vertex subset $D\subseteq V$‎, ‎a vertex $v\in V$ is called a dominator of D if v is adjacent to every vertex in D‎, ‎and an anti-dominator of D if v is not adjacent to any vertex in D. ‎Given a coloring $C=\{V_{1},V_{2},\ldots,
Hadi Nouri Samani, Saeid Alikhani, Nima Ghanbari   +2 more
doaj   +1 more source

On Irregular Colorings of Unicyclic Graph Family

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023
Irregular coloring is a proper coloring and each vertex on a graph must have a different code. The color code of a vertex v is  where  and    is the number of vertices that are adjacent to v and colored i.
Arika Indah Kristiana, Dafik Dafik, Qurrotul A’yun, Robiatul Adawiyah, Ridho Alfarisi   +4 more
doaj   +1 more source

A linear algorithm for the grundy number of a tree

, 2014
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj .
Bouhlel, Mohamed Salim, Mansouri, Ali
core   +1 more source

Polynomial Cases for the Vertex Coloring Problem [PDF]

Algorithmica, 2018
This article contains results from arXiv:1707 ...
T. Karthick, Frédéric Maffray, Lucas Pastor   +2 more
openaire   +4 more sources

Symmetries of stochastic colored vertex models [PDF]

The Annals of Probability, 2021
We discover a new property of the stochastic colored six-vertex model called flip-invariance. We use it to show that for a given collection of observables of the model, any transformation that preserves the distribution of each individual observable also preserves their joint distribution.
openaire   +4 more sources