Results 101 to 110 of about 82,445 (208)

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

Barekeng
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati   +4 more
doaj   +1 more source

On sum coloring of graphs

Discrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Extending Graph Colorings

Journal of Combinatorial Theory, Series B, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emily Moore, Michael O. Albertson
openaire   +2 more sources

Joint User Clustering and Graph Coloring Based Pilot Assignment for Cell-Free Massive MIMO Systems. [PDF]

Sensors (Basel), 2023
Huang X, Wang Y, Chen S, Li Y, Wu Y.
europepmc   +1 more source

Hoffman colorings of graphs

Linear Algebra and its Applications
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for general graphs not much is known.
Abiad, Aida, Bosma, Wieb, Veluw, Thijs van   +2 more
openaire   +5 more sources

Coloring a graph optimally with two colors

Discrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Gobel, Haitze J. Broersma
openaire   +3 more sources

Graph coloring using the reduced quantum genetic algorithm. [PDF]

PeerJ Comput Sci, 2022
Ardelean SM, Udrescu M.
europepmc   +1 more source

On Coloring Resilient Graphs [PDF]

, 2014
Appearing in MFCS ...
Jeremy Kun, Lev Reyzin
openaire   +2 more sources

The analysis of the implementation of RBL-STEM learning materials in improving student's meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques. [PDF]

Heliyon, 2023
Dafik, Kadir, Maryati TK, Sufirman, Ridlo ZR.   +4 more
europepmc   +1 more source

Irreducible No-Hole L(2, 1)-Coloring of Edge-Multiplicity-Paths-Replacement Graph

Discussiones Mathematicae Graph Theory, 2018
An L(2, 1)-coloring (or labeling) of a simple connected graph G is a mapping f : V (G) → Z+ ∪ {0} such that |f(u)−f(v)| ≥ 2 for all edges uv of G, and |f(u) − f(v)| ≥ 1 if u and v are at distance two in G.
Mandal Nibedita, Panigrahi Pratima
doaj   +1 more source