In k-Digraph Coloring we are given a digraph and asked to partition its vertices into at most k sets, so that each set induces DAG. This well-known problem is NP-hard, as it generalizes (undirected) k-Coloring, but becomes trivial if the input acyclic. poses natural parameterized complexity question of what happens when “almost” this paper study using parameters measure input’s distance acyclic...

A digraph is semicomplete if any two vertices are connected by at least one arc and locally the out-neighbourhood in-neighbourhood of vertex induce a digraph. In this paper we study various subclasses digraphs for which give structural decomposition theorems. As consequence obtain several applications, among an answer to conjecture Naserasr first third authors (Aboulker et al., 2021): oriented ...

A contact mapping strategy was applied to identify putative amino acid residues that influence the oxidosqualene-lanosterol B-ring cyclization reaction. A bicyclic intermediate with two altered deprotonation products, in conjunction with lanosterol, were isolated from the ERG7(Y707X) mutants, indicating that the Tyr707 residue may play a functional role in stabilizing the chair-boat bicyclic C-...

Methods to access natural-product-like macrocyclic peptides can disclose new opportunities for the exploration of this important structural class for chemical biology and drug discovery applications. Here, the scope and mechanism of a novel strategy for directing the biosynthesis of thioether-bridged bicyclic peptides in bacterial cells was investigated. This method entails split intein-catalyz...

In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. Let Gc 1,n and Gc 2,n be the classes of the connected graphs of order n whose complements are bicyclic with exactly two and t...