Results 41 to 50 of about 27,939 (295)
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
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
Chromatic numbers and products
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dwight Duffus, Norbert W. Sauer
openaire +2 more sources
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
On the Strong Chromatic Number of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2006 The strong chromatic number, $χ_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\lceil n/k\rceil-n$ isolated vertices to $G$ and considering {\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \ldots, V_{\lceil n/k\rceil}$ of size $k$ each, one can find a proper $k$-vertex ...
Maria Axenovich, Ryan R. Martin
openaire +2 more sources
Advanced Functional Materials, EarlyView.Liquid‐phase transmission electron microscopy enables direct observation of nucleation and growth processes in solution. This review is dedicated to the remembrance of Helmut Cölfen and highlights recent studies on complex materials—oxides, biominerals, organic–inorganic crystals—which were central to his research activity. It summarizes key milestones,
Charles Sidhoum +5 more
wiley +1 more source
The Chromatic Number of a Signed Graph [PDF]
The Electronic Journal of Combinatorics, 2016 In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph $G$ as a mapping $\phi\colon V(G)\to \mathbb{Z}$ such that for any two adjacent vertices $u$ and $v$ the colour $\phi(u)$ is different from the colour $\sigma(uv)\phi(v)$, where is $\sigma(uv)$ is the sign of the edge $uv$.
Edita Mácajová +2 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.We propose a suture‐complementary approach that integrates optical skin clearing with a strain‐programmable luminescent adhesive patch. Hyaluronic acid promotes transdermal delivery of tartrazine to improve optical clearing and stabilizes its interaction with a photosensitizer. Optical clearing increases the penetration depth of visible light into skin,
Seong‐Jong Kim +6 more
wiley +1 more source
Cyclic Olefin Copolymers as Versatile Materials for Advanced Engineering Applications
Advanced Functional Materials, EarlyView.Cyclic olefin copolymers (COCs) are presented as highly versatile materials combining tunable synthesis, excellent optical properties, and mechanical robustness. Their potential spans microfluidics, bioengineering, and advanced electronics, while emerging self‐healing and sustainable solutions highlight future opportunities.
Giulia Fredi +3 more
wiley +1 more source
, 2020 Let us say a graph G has "tree-chromatic number" at most k if it admits a tree-decomposition (T, (X t : t ∈ V (T ))) such that G[X t ] has chromatic number at most k for each t ∈ V (T ).
Paul Seymour
core