Results 11 to 20 of about 18,582 (315)
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 +4 more
doaj +1 more source
Algorithmica, 2017 In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used.
Luis Barba +6 more
openaire +6 more sources
Batch Coloring of Graphs [PDF]
Algorithmica, 2017 In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input ...
Joan Boyar +4 more
openaire +5 more sources
Coloring Graphs in Oriented Coloring of Cubic Graphs
Graphs and Combinatorics, 2022 AbstractOriented coloring of an oriented graph G is an arc-preserving homomorphism from G into a tournament H. We say that the graph H is universal for a family of oriented graphs $$\mathcal {C}$$ C if for every $$G\in \mathcal {C}$$ G ∈ C
openaire +2 more sources
Physical Review Letters, 2002 We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high connectivity are uncolorable.
R. MULET +3 more
openaire +5 more sources
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
Proceedings of the National Academy of Sciences, 1931 In another paper, L,3 the author has given a proof of a formula for M(λ), the number of ways of coloring a graph in λ colors, due to Birkhoff. The numbers m ij , in terms of which M(λ) is expressed, are here studied in detail; a method of calculating them is given.
openaire +3 more sources
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring
Arika Indah Kristiana +2 more
doaj +1 more source
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
AKCE International Journal of Graphs and Combinatorics, 2020 An L(2, 1)-coloring of a graph G is a mapping such that for all edges uv of G, and if u and v are at distance two in G. The span of an L(2, 1)-coloring f of G, denoted by span(f), is max The span of G, denoted by is the minimum span of all possible L(2 ...
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
On the Total Set Chromatic Number of Graphs
Theory and Applications of Graphs, 2022 Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets.
Mark Anthony C. Tolentino +2 more
doaj +1 more source