Results 41 to 50 of about 783,181 (348)
Progress on perfect graphs [PDF]
Mathematical Programming, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Chudnovsky +3 more
openaire +2 more sources
Perfect codes in power graphs of finite groups
Open Mathematics, 2017 The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +3 more sources
Heterotropic regulation and negative homotropic cooperativity
FEBS Open Bio, EarlyView.We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea +5 more
wiley +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
GelMA‐based 3D spheroids recapitulate transcriptomic and functional hallmarks of myeloid sarcoma
FEBS Open Bio, EarlyView.GelMA 5% hydrogels support the formation of myeloid leukemia spheroids that recapitulate MS‐specific features, including G1 arrest, apoptosis, and ECM‐driven transcriptomic reprogramming. The 3D model mimicked soft‐tissue‐like stiffness and oxygen conditions, and transcriptomic convergence with primary MS samples confirmed its utility as a preclinical ...
Nicolas Germain +11 more
wiley +1 more source
On perfectness of sums of graphs
Discrete Mathematics, 1999 The sum (also known as Cartesian product) \(G+H\) of two graphs \(G= (X,U)\) and \(H= (Y,V)\) has vertex set \(Z= \{(x,y)\mid x\in X, y\in Y\}\) and edge set \(W= \{[(x,y),(x',y')]\mid x= x',[y,y']\in V\) or \(y= y'\), \([x,x']\in U\}\). The authors motivate the study of the characterization of perfect sum graphs through the result that a graph \(G ...
de Werra, D., Hertz, A.
openaire +4 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Perfect codes over graphs [PDF]
, 1986 We present a generalization of the notion of perfect codes: perfect codes over graphs. We show an infinite family of 1-perfect codes in second powers of graphs and we prove the nonexistence of nontrivial 1-perfect codes over complete bipartite graphs ...
Kratochvíl, Jan
core +1 more source