Results 71 to 80 of about 15,555,412 (284)
Advanced Materials, EarlyView.Melt electrofibrillation (MEF) enables the fabrication of nanofibrillar PCL scaffolds with defined architectures that guide cellular alignment and retention during cartilage tissue engineering. Unlike conventional melt electrowriting, MEF consistently directs collagen type II‐rich extracellular matrix organization, providing a tunable platform to ...
Alba Pueyo Moliner +10 more
wiley +1 more source
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13
Discrete Mathematics, 2018 The neighbor-distinguishing total chromatic number χ a ′ ′ ( G ) of a graph G is the smallest integer k such that G can be totally colored using k colors with a condition that any two adjacent vertices have different sets of colors.
Jing-Jing Huo, Weifan Wang, Yiqiao Wang
semanticscholar +1 more source
3D Printed Photon Shield Assembly for Low‐Noise Visual Stimulation During Two‐Photon Imaging in Mice
Advanced Materials Technologies, EarlyView.We present the Photon Shield, an open‐hardware system for low‐noise two‐photon calcium imaging during visual stimulation in mice. Combining a 3D‐printed headplate and rail‐mounted shield substantially reduces stray‐light contamination, as quantitatively verified. Functional validation confirms reliable cortical responses. Open design files enable broad
Gergely Katona +6 more
wiley +1 more source
Edge and total choosability of near-outerplanar graphs [PDF]
, 2006 It is proved that, if G is a K4-minor-free graph with maximum degree ∆ ≥ 4, then G is totally (∆ + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ∆ + 1 colours, then every element can be coloured with a colour from ...
Woodall, DR, Hetherington, TJ
core
Note on vertex and total proper connection numbers
AKCE International Journal of Graphs and Combinatorics, 2016 This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs.
Emily Chizmar +2 more
doaj +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Discussiones Mathematicae Graph Theory, 2020 A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source
Total Chromatic Number of Middle and Total Graph of Path and Sunlet Graph
, 2018 In this paper, we have considered the finite, simple and undirected graphs. Let ( ( ), ( )) G V G E G be a graph with the vertex set ( ) V G and the edge set ( ) E G respectively.
D. Muthuramakrishnan, G. Jayaraman
semanticscholar +1 more source
Advanced Optical Materials, EarlyView.A new luminescence mechanism in Cs2NaInCl₆ is revealed through spontaneously formed In3+→In+ centers and Er3+/Yb3+/Sb3+ doping. Tunable visible, near‐infrared, downconversion, and upconversion emissions are demonstrated, while DFT calculations explain the electronic structure.
Inna A. Ivashchenko +10 more
wiley +1 more source
A study of the total chromatic number of equibipartite graphs [PDF]
, 1998 The total chromatic number χt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is
Chen, Bor-Liang +3 more
core +1 more source
The total chromatic number of split-indifference graphs [PDF]
, 2012 4 p. : il.The total chromatic number of a graph G, !T (G), is the least number of colours su!cient to colour the vertices and edges of a graph such that no incident or adjacent elements (vertices or edges) receive the same colour.
Figueiredo, Celina Miraglia Herrera de +3 more
core +2 more sources