Results 231 to 240 of about 9,500 (263)
Specialization of Sesquiterpene Lactone Metabolites in <i>Liriodendron</i> Plant Defense. [PDF]
Chen S +8 more
europepmc +1 more source
Fully automated segmentation of [18F]FDG- and PSMA-PET/CT images via data-centric Deep-Learning.
Pires M +43 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammed A. Mutar +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammed A. Mutar +2 more
openaire +2 more sources
Journal of Graph Theory, 1978
AbstractFor n = 1, 2, …, let Bn = K2 + K̄n. We pose the problem of determining the Ramsey numbers r(Bm, Bn) and demonstrate that in many cases critical colorings are avialable from known examples of strongly regular graphs.
Cecil C. Rousseau, J. Sheehan
openaire +1 more source
AbstractFor n = 1, 2, …, let Bn = K2 + K̄n. We pose the problem of determining the Ramsey numbers r(Bm, Bn) and demonstrate that in many cases critical colorings are avialable from known examples of strongly regular graphs.
Cecil C. Rousseau, J. Sheehan
openaire +1 more source
COMBINATORICA, 1998
The induced Ramsey number \(r_{\text{ind}}(G,H)\), is the smallest possible order of a graph \(F\) with the property that if the edges of \(F\) are \(2\)-colored, there is an induced subgraph of \(G\) in the first color or \(H\) in the second color.
Yoshiharu Kohayakawa +2 more
openaire +1 more source
The induced Ramsey number \(r_{\text{ind}}(G,H)\), is the smallest possible order of a graph \(F\) with the property that if the edges of \(F\) are \(2\)-colored, there is an induced subgraph of \(G\) in the first color or \(H\) in the second color.
Yoshiharu Kohayakawa +2 more
openaire +1 more source
Graphs and Combinatorics, 1991
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
openaire +1 more source
Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
openaire +1 more source
Doklady Mathematics, 2013
A graph is a distance graph in \(R^d,\) the \(d\)-dimension Euclidean space, if its vertices can be associated with different points of \(R^d\) such that any pair of adjacent vertices of such a graph corresponds to a pair of points a unit distance apart.
Kupavskii, A. B., Titova, M. V.
openaire +2 more sources
A graph is a distance graph in \(R^d,\) the \(d\)-dimension Euclidean space, if its vertices can be associated with different points of \(R^d\) such that any pair of adjacent vertices of such a graph corresponds to a pair of points a unit distance apart.
Kupavskii, A. B., Titova, M. V.
openaire +2 more sources

