Results 41 to 50 of about 119,953 (318)
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
Selecciones 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
International 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
Journal 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
Advanced 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
Oriented coloring on recursively defined digraphs
, 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=(V,A)
Gurski, Frank +2 more
core +1 more source
DENTA: A Dual Enzymatic Nanoagent for Self‐Activating Tooth Whitening and Biofilm Disruption
Advanced Functional Materials, EarlyView.The nanoapatite with dual enzymes (DENTA) accumulates in dentinal tubules, reducing hypersensitivity caused by dental nerve exposure and facilitating continuous ROS generation through salivary glucose for effective, long‐term whitening. The dentin structures remain non‐destructive due to the low concentration of ROS, demonstrating excellent cell ...
Junseok Kim +13 more
wiley +1 more source
The Locating-Chromatic Number of Origami Graphs
Algorithms, 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
Conflict-free coloring of graphs [PDF]
, 2013 We study the conflict-free chromatic number chi_{CF} of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have.
Glebov, Roman +2 more
core
Hamiltonian Chromatic Number of Trees [PDF]
, 2020 This is a final version appeared in proceedings of RAGT 2019 ...
Bantva, Devsi, Vaidya, Samir
openaire +2 more sources
Advanced Functional Materials, EarlyView.This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva +9 more
wiley +1 more source