Results 201 to 210 of about 889,165 (240)

Pt‐Mediated Co‐Adsorption of Hydroxyl and Nitrogen‐Heterocyclic Species Over Cu/CuO Heterostructure Enhances Coupled Azotriazole Electrosynthesis and Dual‐Electrode Hydrogen Production

Angewandte Chemie, Volume 138, Issue 42, 12 October 2026.
Pt@Cu/CuO heterostructures were designed for electrochemical N─N coupling of 3,5‐diamino‐1H‐1,2,4‐triazole. Mechanism investigation revealed that the Pt sites mediated co‐adsorption of substrates and hydroxyl on Cu/CuO sites. The elaborate Pt@Cu/CuO achieved an ultralow working potential of 0.832 VRHE with a high FE of 95%. A long‐term stability of 600
Jiachen Li, Hanggu Su, Yuqiang Ma, Meng Li, Ruhao Zhang, Cihang Wang, Zihang Zhao, Jun Hu, Xiaogang Mu, Xuanjun Wang, Haixia Ma, Zhengxiao Guo   +11 more
wiley   +2 more sources

Bistable Switching of π‐Conjugation in a Dithienylethene‐Bridged Luminescent Trityl Diradicaloid

Angewandte Chemie International Edition, Volume 65, Issue 43, 19 October 2026.
Photoswitches that affect π‐conjugation offer a powerful strategy for external manipulation of luminescent diradicals. Dithienylethene‐linked persistent trityl diradicaloids, DTE‐TTM2 and F6‐DTE‐TTM2, exhibit bistable switching of their optical, electrochemical and magnetic properties.
Xingmao Chang, Sören Schlittenhardt, Julia Zolg, Maximilian Herm, Siyang He, Vivek Chandrakant Wakchaure, Dinar Abdullin, Robert Göstl, Dirk M. Guldi, Alexander J. C. Kuehne, Sabine Richert, Max von Delius   +11 more
wiley   +1 more source

A Practical Guide to First‐Principles Calculations for Pseudocapacitive Materials: From Electrochemical Experiments to Atomistic Understanding

ChemElectroChem, Volume 13, Issue 20, 16 October 2026.
Electrochemical experiments reveal what happens, whereas first principles calculations explain why. Emerging computational electrochemistry is bridging these perspectives, enabling quantitative understanding of electrode/electrolyte interfaces and enabling the rational design of next‐generation energy storage materials.
Kenji Oqmhula, Ryo Maezono, Kenta Hongo
wiley   +1 more source

The Part and the Whole: Field‐Dependent THz‐EPR Spectroscopy Probes Lattice‐Dependent Electronic Structure in Iron(II) Spin Crossover

Angewandte Chemie International Edition, Volume 65, Issue 42, 12 October 2026.
THz‐EPR spectroscopy provides direct access to the low‐lying electronic structure and spin–phonon coupling in iron(II) spin crossover (SCO) complexes. Quantification of the high‐spin fraction (γHS$\gamma _{\text{HS}}$) and subtle shifts in magnetic transitions reveal the influence of the surrounding lattice and enable discrimination between microscopic
Jooris Beyer, Gerald Ebert, Andreas Dürrmann, Benjamin Kintzel, Gerald Hörner, Tarek Al Said, Karsten Holldack, Birgit Weber, Winfried Plass   +8 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Hamiltonian Cycles and Hamiltonian Paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Sohel Rahman, M Kaykobad
exaly   +3 more sources

The Square of a Hamiltonian Cycle

SIAM Journal on Discrete Mathematics, 1994
Let C be a cycle. The square of C is the graph obtained by joining every pair of vertices of distance 2 in C. Let G be a graph on n vertices with minimum degree $\delta ( G )$. This paper proves that, if $\delta ( G ) \geq \frac{5}{7}n$, then G contains the square of a Hamiltonian cycle.
Genghua Fan, Roland Häggkvist
openaire   +1 more source

Hamiltonian Cycles and Markov Chains

Mathematics of Operations Research, 1994
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains.
Filar, JA, Krass, D
openaire   +4 more sources

A Remark on Hamiltonian Cycles

Mathematische Nachrichten, 1992
AbstractLet G be an undirected and simple graph on n vertices. Let ω, α and χ denote the number of components, the independence number and the connectivity number of G. G is called a 1‐tough graph if ω(G – S) ⩽ |S| for any subset S of V(G) such that ω(G − S) > 1.
openaire   +2 more sources

On Hamiltonian cycles in the FCC grid

Computers & Graphics, 2020
Abstract The face centered cubic (FCC) grid is a space-filling grid, one of the alternatives to the traditional cubic one. We show that there are five Hamiltonian cycles (non-equivalent up to rotation and symmetry), connecting the faces of a voxel in the FCC grid.
Lidija Comic, Paola Magillo
openaire   +2 more sources

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments

Journal of Algorithms, 1993
Summary: We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is \(O(\log n)\) using \(O(n^2/\log n)\) processors on a CRCW PRAM, and \(O(\log n \log \log n)\) on an EREW PRAM using \(O(n^2/ \log n \log \log n ...
Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha   +3 more
openaire   +1 more source