Results 81 to 90 of about 3,567,425 (361)
Three infinite families of Hamilton-connected convex polytopes and their detour index
AIMS MathematicsA path in a graph encompassing its whole vertex set is called Hamiltonian. Such a path with sharing the same initial and terminal vertices is called a Hamiltonian cycle. A graph comprising a Hamiltonian path (resp.
Sakander Hayat +3 more
doaj +1 more source
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
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Andrzej Dudek +3 more
openaire +4 more sources
Precursor Mineral Phases of Forming Mollusk Shell Nacre: A Study of Hydrated Samples
Advanced Functional Materials, EarlyView.Mineral, organic phase, and water are the essential components in mollusk shell nacre formation. Their interplay is not well understood, because the hydrated material is difficult to observe at high resolution, under close to native conditions. Forming nacre is studied using environmental and cryo‐electron microscopy and hydrated ACC phases, together ...
Anna Kozell +4 more
wiley +1 more source
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
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 Ruciński +2 more
openaire +2 more sources
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj +1 more source
Universality for transversal Hamilton cycles
Bulletin of the London Mathematical SocietyAbstractLet be a graph collection on a common vertex set of size such that for every . We show that contains every Hamilton cycle pattern. That is, for every map there is a Hamilton cycle whose th edge lies in .
Candida Bowtell +3 more
openaire +3 more sources
Powers of Hamilton cycles in tournaments
Journal of Combinatorial Theory, Series B, 1990 AbstractOur main aim is to show that for every ε > 0 and k ∈ N there is an n(ε, k) such that if T is a tournament of order n ≥n(ε, k) and in T every vertex has indegree at least (14+ε)n and at most (34−ε)n then T contains the kth power of a Hamilton cycle.
Roland Häggkvist, Béla Bollobás
openaire +2 more sources
A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3
, 2020 Based on the famous Rotation-Extension technique, by creating the new concepts and methods: broad cycle, main segment, useful cut and insert, destroying edges for a main segment, main goal Hamilton cycle, depth-first search tree, we develop a polynomial ...
Du, Lizhi
core