Results 41 to 50 of about 117,877 (279)

Two floor building needing eight colors [PDF]

open access: yes, 2014
Motivated by frequency assignment in office blocks, we study the chromatic number of the adjacency graph of $3$-dimensional parallelepiped arrangements. In the case each parallelepiped is within one floor, a direct application of the Four-Colour Theorem ...
Bessy, Stéphane   +2 more
core   +4 more sources

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

open access: yesEuropean Journal of Combinatorics, 1998
This paper studies the circular (or star) chromatic numbers and fractional chromatic numbers of distance graphs \(G(Z, D)\) for various sets \(D\) (being the graph with vertex set a subset of the integers, and two vertices \(x\), \(y\) being adjacent iff \(| x-y|\in D\)). Various specific cases are calculated, including all cases when \(| D|= 2\).
Chang, Gerard J.   +2 more
openaire   +2 more sources

List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok

open access: yesSelecciones Matemáticas, 2019
In this paper, we determine list-chromatic number and characterize chromatically unique of the graph G = Kr2+k.
Le Xuan Hung
doaj   +1 more source

Monotone Chromatic Number of Graphs

open access: yesInternational Journal of Analysis and Applications, 2020
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh   +3 more
doaj  

The Locating Chromatic Number of Book Graph

open access: yesJournal of Mathematics, 2021
Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah   +2 more
doaj   +1 more source

Near‐Infrared Emitting Lanthanide Catecholate Giant Single Crystals – Morphology Control and Photon Down‐Conversion

open access: yesAdvanced Functional Materials, EarlyView.
Controlled syntheses of lanthanide coordination polymers based on the dihydroxybenzoquinone (DHBQ) organic linker afforded large single crystals of Ln‐DHBQ CPs (Ln = Yb, Nd). A novel structural variant of Yb‐DHBQ is identified by means of single crystal diffraction analysis.
Marina I. Schönherr   +7 more
wiley   +1 more source

The Effect of Purcell Cavities on the Lifetime of Thermally Activated Delayed Fluorescent Emitters

open access: yesAdvanced Functional Materials, EarlyView.
A pressing challenge to OLED displays and lighting is to balance high efficiency and long operational lifetime in the deep blue spectrum. The Purcell effect can reduce the triplet density and hence the probability for destructive energy‐driven triplet annihilation events that limit the OLED lifetime. Here we study of the Purcell effect on two different
Sritoma Paul   +4 more
wiley   +1 more source

The Locating-Chromatic Number of Origami Graphs

open access: yesAlgorithms, 2021
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by χL(G).
Agus Irawan   +3 more
doaj   +1 more source

Some Results on incidence coloring, star arboricity and domination number [PDF]

open access: yes, 2012
Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an upper bound and a lower bound of the incidence chromatic number for all graphs.
Shiu, Wai Chee, Sun, Pak Kiu
core  

Hamiltonian Chromatic Number of Trees [PDF]

open access: yes, 2020
This is a final version appeared in proceedings of RAGT 2019 ...
Bantva, Devsi, Vaidya, Samir
openaire   +2 more sources

Home - About - Disclaimer - Privacy