[structure: see text]. The tetracyclic ketal 24, a suitable intermediate for the synthesis of antitumor pentacyclic quassinoids, has been efficiently prepared from communic acids (5a-c), via methyl ketone 9. The synthetic sequence from 9 to 24 consists of 15 steps in 12% overall yield.

High photoconductivity of p-type nanofibers fabricated from a reducing tetracyclic macromolecule was achieved though a simple photodoping process under ambient conditions, which, together with the intrinsic high surface area and porosity of the nanofibers when deposited on a substrate, enables application in electrical vapor sensing of organic amines.

A gold-catalyzed cascade process for the synthesis of dihydroquinazolinone scaffolds was developed. series gold catalysts were screened this tandem transformation, and (PPh3)AuCl/AgOTf catalyst combination found to be best system. This method is characterized by good yields, high regioselectivity, broad substrate scope. also applicable tetracyclic dihydroquinazolinones seven-membered ring-fused...

Microbial-catalyzed biotransformations have considerable potential for the generation of an enormous variety of structurally diversified organic compounds, especially natural products with complex structures like triterpenoids. They offer efficient and economical ways to produce semi-synthetic analogues and novel lead molecules. Microorganisms such as bacteria and fungi could catalyze chemo-, r...

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...