Results 41 to 50 of about 2,293,482 (304)
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
Switching Superconductivity with Uniaxial Strain in a high‐Tc${\rm T}_{c}$ Cuprate Superconductor
Advanced Functional Materials, EarlyView.Uniaxial strain is demonstrated as a new scheme for a superconductivity switch. Exploiting the large strain‐induced Tc shift in a cuprate superconductor enables robust switching between superconducting and normal states over 100 cycles with only 0.1% strain.
Baizhi Gao +3 more
wiley +1 more source
Rainbow Hamilton Cycles in Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 Let $K_n^{(k)}$ be the complete $k$-uniform hypergraph, $k\ge3$, and let $\ell$ be an integer such that $1\le \ell\le k-1$ and $k-\ell$ divides $n$. An $\ell$-overlapping Hamilton cycle in $K_n^{(k)}$ is a spanning subhypergraph $C$ of $K_n^{(k)}$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists
Andrzej Dudek +2 more
openaire +3 more sources
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 College Library Home Notes [PDF]
, 2009 Communal Societies Collection: New Acquisitions Hamilton College Library recently acquired a remarkable collection of documents relating to Joanna Southcott (1750-1814) for its Communal Societies Collection. Southcott is considered to have been the first
core
Advanced Healthcare Materials, EarlyView.Inspired by conventional cell therapy and emerging bioengineering approaches, the tissue‐engineered nigrostriatal pathway (TE‐NSP) has an anatomically‐inspired design comprising a population of human dopaminergic neurons with unidirectional, long‐projecting axon tracts.
Wisberty J. Gordián‐Vélez +8 more
wiley +1 more source
Hamilton City Green Map: a guide to environmentally significant sites in Hamilton.
, 2002 A map of Hamilton, New Zealand, showing sites of cultural, heritage, and environmental interest along with other notable landmarks. using icons from and inspired by the Green Map System. An inset map shows Hamilton bus routes.
Hamilton (N.Z.). City Council
core +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
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