Results 31 to 40 of about 663 (192)
On shortest crucial words avoiding abelian powers [PDF]
, 2010 Let k≥2k≥2 be an integer. An abelian kkth power is a word of the form X1X2⋯XkX1X2⋯Xk where XiXi is a permutation of X1X1 for 2≤i≤k2≤i≤k. A word WW is said to be crucial with respect to abelian kkth powers if WW avoids abelian kkth powers, but WxWx ends ...
Halldorsson, Bjarni +3 more
core +2 more sources
Edge colorings of K2n with a prescribed condition — I
Discrete Mathematics, 2000 A graph \(L\) is called a lantern if it has two adjacent vertices \(u\), \(v\) such that all the other vertices of \(L\) are adjacent to both \(u\) and \(v\), and \(L\) has no other edges. The main result of this paper is the following: If \(L\) is a lantern of order \(2n\geq 8\), then any edge-coloring of \(L\) using \(2n-1\) colors can be extended to
Qizhang Liu, H. P. Yap
openaire +1 more source
Crystal structure of bis(benzoato-kO)bis(2,2'-biimidazole- k2N,N')copper(II), Cu(C6H6N4)2(C7H5O2)2
Zeitschrift für Kristallographie - New Crystal Structures, 2011 Yang Wei +6 more
doaj +2 more sources
Resolution of the Oberwolfach problem [PDF]
, 2021 The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of K2n+1 into edge-disjoint copies of a given 2-factor. We show that this can be achieved for all large n.
Joos, Felix +9 more
core +1 more source
Angewandte Chemie, Volume 138, Issue 42, 12 October 2026.The cobalt(II) bis(trifluoroacetylcamphorate) scaffold exhibits versatile coordination chemistry with solvent‐driven ligand exchange and geometrical rearrangements, associated with unique chiroptical properties. Microcrystalline suspension of [Co(tfc)2(CH3CN)2] revealed the largest VCD dissymmetry factor ever reported (g ≈ 0.2 at 1600 cm−1), arising ...
Gianmarco Papi +4 more
wiley +2 more sources
Zeitschrift Fur Kristallographie - New Crystal Structures, 2011 Jun Zhang, Jing-Cheng Zhu, Kun Ying
exaly +2 more sources
Однозначная списочная раскрашиваемость графа Kn2 + Kr [PDF]
, 2022 Given a list L(v) for each vertex v, we say that the graph G is L-colorable if there is a proper vertex coloring of G, where each vertex v takes its color from L(v). The graph is uniquely k-list colorable if there is a list assignment L such that jL(v)j =
Hung, L. X., null null, Le Xuan Hung
core +1 more source
, 2017 An [n×1] head-to-tail bonding strategy has been used for the synthesis of ReI metallacycles. From a k3N-dicarbonyl precursor, a single discrete [4×1] square assembly was isolated and characterized, whereas a k2N-tricarbonyl precursor led to two major ...
Francesco Palomba +7 more
core +1 more source
Angewandte Chemie, Volume 138, Issue 30, 20 July 2026.Like a shark playing hide‐and‐seek in a coral reef, energy transfer (ET) finds hidden “fish” catalysts in the porous support “reef.” ET allows catalytic species to be precisely mapped, revealing whether they reside near the surface, deep in the pores, or are uniformly distributed. This approach ensures controlled catalyst distribution, highlighting how
Buddhima K. P. Maldeni Kankanamalage +8 more
wiley +2 more sources