Results 311 to 320 of about 973,826 (351)
MGA: a tool for haplotype-mixed assembly of long and accurate reads. [PDF]
Genome BiolZhang Z +3 more
europepmc +1 more source
Learning gene interactions from tabular gene expression data using Graph Neural Networks
Boulougouri M +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A generalization of perfect graphs?i-perfect graphs
Journal of Graph Theory, 1996The \(i\)-chromatic number of \(G\), denoted \(\chi_i(G)\), is the least number \(k\) such that there is a \(k\)-colouring with no colour class inducing a \(K_{i+1}\) as a subgraph. The \(i\)-clique number, \(\omega_i(G)\), is defined to be \(\lceil \omega(G)/i\rceil\). An induced subgraph \(H\) of \(G\) is an \(i\)-transversal iff \(\omega(H)= i\) and
Leizhen Cai, Derek G. Corneil
openaire +3 more sources
Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
KORNER, JANOS +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
KORNER, JANOS +2 more
openaire +3 more sources
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
Summary: The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect. Previous proofs of this hypothesis have used combinatorial or polyhedral methods. In this paper, the concept of norms related to graphs is used to provide an alternative proof for the weak Berge hypothesis.
Szczepan Perz, Stefan Rolewicz
openaire +2 more sources
Summary: The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect. Previous proofs of this hypothesis have used combinatorial or polyhedral methods. In this paper, the concept of norms related to graphs is used to provide an alternative proof for the weak Berge hypothesis.
Szczepan Perz, Stefan Rolewicz
openaire +2 more sources
Journal of Graph Theory, 2005 AbstractFor 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k − 1, in which i ∼j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is
Xuding Zhu
exaly +2 more sources
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Hougardy
exaly +2 more sources
Cycle-perfect graphs are perfect
Journal of Graph Theory, 1996Given any graph \(G\), the cycle graph \(C(G)\) of \(G\) is defined by letting the vertices of \(C(G)\) be the induced cycles of \(G\); two induced cycles of \(G\) are adjacent in \(C(G)\) if they have in \(G\) at least one edge in common. \(G\) is called cycle-perfect if \(G\) and \(C(G)\) have no chordless cycles of odd length at least five.
openaire +3 more sources
Information Processing Letters, 1983
Abstract A perfect stable in a graph G is a stable S with the property that any vertex of G is either in S or adjacent with at least two vertices which are in S. This concept is an obvious generalization of the notion of perfect matching. In this note, the problem of deciding if a given graph has a perfect stable is considered.
Cornelius Croitoru, Emilian Suditu
openaire +1 more source
Abstract A perfect stable in a graph G is a stable S with the property that any vertex of G is either in S or adjacent with at least two vertices which are in S. This concept is an obvious generalization of the notion of perfect matching. In this note, the problem of deciding if a given graph has a perfect stable is considered.
Cornelius Croitoru, Emilian Suditu
openaire +1 more source