Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Thermal,morphostructural and spectrometric characterization of an antibacterial kaolinite-based filter modified with silver for water treatment

Journal of Thermal Analysis and Calorimetry - The aim of this work is to synthesize and characterize a new structured silver–clay dried, calcined or sintered at different temperatures...     

Sulfonamide-Functionalized Porous Organic Framework as an Efficient Heterogeneous Acid Catalyst for One-Pot Preparation of 1,8-Dioxooctahydroxanthenes

Russian Journal of Organic Chemistry - Herein, we report the sulfonamide-functionalized covalent organic framework (COF-SO3H), prepared by condensation of melamine and terephthalaldehyde and...