Results 11 to 20 of about 82,445 (208)
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.
Roberto Mulet +3 more
openalex +7 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raphael Yuster
openalex +3 more sources
Oriented Coloring on Recursively Defined Digraphs
Algorithms, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G =
Frank Gurski +2 more
doaj +3 more sources
Discrete Mathematics, 2003 Let \(P\) be a property of a set of vertices of a graph (e.g., being a maximal independent set in the graph). An iterated \(P\)-coloring of a graph is one that can be obtained through the following greedy algorithm (called iterated coloring algorithm by the authors): Repeatedly choose a set of vertices with property \(P\), color it with an unused color
Sandra M. Hedetniemi +4 more
openalex +4 more sources
The Coloring Ideal and Coloring Complex of a Graph [PDF]
Journal of Algebraic Combinatorics, 2001 13 pages, 3 ...
Einar Steingrı́msson
openalex +5 more sources
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2022 Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G ...
Arika Indah Kristiana +3 more
doaj +1 more source
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
Edge Coloring Of Complement Bipolar Fuzzy Graphs
Ratio Mathematica, 2023 : Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems.
S. Yahya Mohamed, Subashini N
doaj +1 more source
Coloring Drawings of Graphs [PDF]
The Electronic Journal of Combinatorics, 2022 We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the maximal connected regions of the drawing, the cells, with $k$ colors such that adjacent cells have different ...
Hertrich, Christoph +2 more
openaire +2 more sources
Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona
Jurnal Derivat, 2022 For example is a chromatic number with the smallest integer so that the graph has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring.
Riduan Yusuf +3 more
doaj +1 more source