Results 251 to 260 of about 9,480,720 (296)
Probing Local Coordination and Halide Miscibility in Single‑, Double‑, and Triple-Halide Perovskites Using EXAFS. [PDF]
Mulgund SS +6 more
europepmc +1 more source
Correction: Ju et al. Discharge Enhancement in a Triple-Pipe Heat Exchanger Filled with Phase Change Material. <i>Nanomaterials</i> 2022, <i>12</i>, 1605. [PDF]
Ju Y +8 more
europepmc +1 more source
Embedding Steiner triple systems in hexagon triple systems
A \textit{Steiner triple} system of order \(n\) (or a triple system) is a pair \((S,T)\), where \(T\) is a collection of edge disjoint triangles, otherwise called triples, which partition the edge set \(K_n\) with vertex set \(S\). It is well known that the spectrum for Steiner triple systems is the set of all \(n \equiv 1\) or \(3 \pmod 6\) and that ...
Gaetano Quattrocchi +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Trails of triples in partial triple systems
Designs, Codes and Cryptography, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles J. Colbourn +2 more
openaire +3 more sources
Journal of Combinatorial Designs, 2016
AbstractAn Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour.
Šajna, Mateja, Wagner, Andrew
openaire +2 more sources
AbstractAn Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour.
Šajna, Mateja, Wagner, Andrew
openaire +2 more sources

