Results 51 to 60 of about 64,068 (309)
The Curriculum of the Jester: An Examination of Hamilton, An American Musical
Journal of Curriculum Theorizing, 2022 Relying on a curriculum theory and cultural studies lens, this paper examines the Broadway musical Hamilton and asks "What history is it teaching?". Focusing on the cycle of cultural production, the paper further examines the lines of impact the musical
Gabriel Stephen Huddleston
doaj +1 more source
Cold Quad‐Modal Nanocomplex for Precise and Quantitative In Vivo Stem Cell Tracking
Advanced Functional Materials, EarlyView.Multimodal albumin–bismuth sulfide–superparamagnetic iron oxide (ABS) nanocomplexes are developed for stem cell tracking across four different imaging modalities: MRI, MPI, MSOT, and CT. Combining its flexibility with high sensitivity, this quad‐modal imaging agent enables a robust quantification of ABS‐labeled stem cells in vivo.
Ali Shakeri‐Zadeh +4 more
wiley +1 more source
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements ...
Borowiecki Mieczysław, Broere Izak
doaj +1 more source
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source
Hamilton Cycles, Minimum Degree, and Bipartite Holes [PDF]
Journal of Graph Theory, 2017 AbstractWe present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large “bipartite hole” (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical theorem, and is related to a theorem of Chvátal and Erdős.
McDiarmid, C, Yolov, N
openaire +3 more sources
Advanced Functional Materials, EarlyView.Herein, an RBC membrane‐derived nanoparticle (CMN‐ICG) is engineered to efficiently deliver a sonosensitizing agent, indocyanine green (ICG), for sonotherapy of hepatocellular carcinoma (HCC). CMN‐ICG exhibits excellent cytocompatibility, significantly enhances hepatocyte uptake, and produces excessive reactive oxygen species (ROS) upon ultrasound ...
Alap Ali Zahid +6 more
wiley +1 more source
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
Hamilton cycles in Euler tour graph
Journal of Combinatorial Theory, Series B, 1986 The Euler tour graph of an Euler graph G denoted by \(E_ u(G)\) is the undirected simple graph defined as follows: The vertices of \(E_ u(G)\) are the Euler tours of G and two Euler tours E and F are adjacent in \(E_ u(G)\) if they can be transformed from each other by a K- transformation which was introduced by Kotzig in 1966.
Zhang, F. J., Guo, X. F.
openaire +3 more sources
Theory‐Guided Design of Non‐Precious Single‐Atom Catalyst for Electrocatalytic Chlorine Evolution
Advanced Functional Materials, EarlyView.To overcome the reliance on noble metals for the chlorine evolution reaction (CER), we designed a non‐precious single‐atom catalyst (SAC), NiN3O–O. It achieves a low overpotential of 75 mV, 95.8% Cl2 selectivity, and outperforms commercial dimensionally stable anodes (DSAs).
Kai Ma +9 more
wiley +1 more source
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source