Results 51 to 60 of about 973,826 (351)
A semi-strong Perfect Graph theorem [PDF]
, 1987 Perfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs has been intensely studied. Much of the work has been directed towards proving Berge's Strong and Weak Perfect Graph Conjectures. L. Lovász finally demonstrated the
Reed, B
core +1 more source
Discussiones Mathematicae Graph Theory, 2013 Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable.
openaire +3 more sources
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
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
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
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
Constructing perfect phylogenies and proper triangulations for three-state characters
Algorithms for Molecular Biology, 2012 In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result states that for three-state characters, the local condition of examining all subsets of three ...
Gysel Rob, Lam Fumei, Gusfield Dan
doaj +1 more source
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source