Results 61 to 70 of about 446,387 (282)
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
Counting Hamilton Cycles in Dirac Hypergraphs
Combinatorica, 2023 AbstractFor $$0\le \ell <k$$ 0 ≤ ℓ < k , a Hamilton $$\ell $$ ℓ -cycle in a k-uniform hypergraph H is a cyclic ordering of the vertices of H in which the edges ...
Ferber, Asaf, Hardiman, Liam, Mond, Adva
openaire +1 more source
Advanced Functional Materials, EarlyView.A Ni,Cd‐codoped Fe2VO4/NF bifunctional electrocatalyst is rationally designed for efficient seawater electrolysis. Synergistic effect modulates electron configuration, optimizes intermediates adsorption, stabilizes high‐valence Fe/V sites, and repels chloride ions to suppress corrosion and side reactions, thus contributing to performance improvement of
Weiguo Huang +15 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
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
Rainbow hamilton cycles in random graphs [PDF]
Random Structures & Algorithms, 2013 AbstractOne of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdős‐Rényi random graph Gn,p is around . Much research has been done to extend this to increasingly challenging random structures.
Alan M. Frieze, Po-Shen Loh
openaire +2 more sources
Advanced Functional Materials, EarlyView.This study highlights the integration of stable two‐dimensional covalent organic framework (COF) films as photoactive layers in hybrid nanoenergy devices. The results demonstrate their capacity to generate electricity under both sunny and rainy conditions, showcasing versatility and resilience.
Joab D. Guerrero +13 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
The number of cycles in a hamilton graph
Discrete Mathematics, 1994 Let \(f(G)\) denote the number of distinct cycles of a graph \(G\). Let \(\Gamma_ k\) be the collection of all Hamiltonian simple graphs of order \(n\) and size \(n+k\). Let \[ m(k)= \min\{f(G);\;G\in \Gamma_ k\},\quad M(k)= \max\{f(G);\;G\in \Gamma_ k\}. \] The reviewer and S. K.
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.Gonzalez Martinez and collaborators develop a strategy to formulate high performance GelMA‐based bioinks with low solids contents. The resulting bioinks enable 3D bioprinting at 37 °C of high‐fidelity structures with tunable mechanical properties that support high cell viability and function.
David A. González‐Martínez +8 more
wiley +1 more source