Results 131 to 140 of about 31,664 (169)

Persistence of protozoan parasites and <i>Escherichia coli</i> on plant tissue in soil. [PDF]

Appl Environ Microbiol
McCaughan KJ, Danyluk MD, Kniel KE.
europepmc   +1 more source

High-Conductivity Electrolytes Screened Using Fragment- and Composition-Aware Deep Learning. [PDF]

Adv Sci (Weinh)
Wang X, Chen M, Bao G, Lai Y, Cao J, Liu X, Tan R.   +6 more
europepmc   +1 more source

Optimizing wireless sensor networks using fuzzy triangular snake graph models and fuzzy topological indices. [PDF]

Sci Rep
Hashem AF, Liaqat S, Mufti ZS, Hanif MF.
europepmc   +1 more source

Primary Care Access and the Role of Telemedicine for Traditional Medicare Beneficiaries.

JAMA Health Forum
Ganguli I, Daley NE, Hicks A, Morgan KM, Mehrotra A, Cutler DM, Rosenthal MB.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Triangle Contact Graphs

Combinatorics, Probability and Computing, 1994
It is proved that any plane graph may be represented by a triangle contact system, that is a collection of triangular disks which are disjoint except at contact points, each contact point being a node of exactly one triangle. Representations using contacts of T-or Y-shaped objects follow.
Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl   +2 more
openaire   +5 more sources

Triangles in an Ordinary Graph

Canadian Journal of Mathematics, 1963
An ordinary graph is a finite linear graph which contains no loops or multiple edges, and in which all edges are undirected. In such a graph G, let N, L, and T denote respectively the number of nodes, edges, and triangles. One problem, suggested by P.
Nordhaus, E. A., Stewart, B. M.
openaire   +1 more source

Median Graphs and Triangle-Free Graphs

SIAM Journal on Discrete Mathematics, 1999
Summary: Let \(M(m,n)\) be the complexity of checking whether a graph \(G\) with medges and \(n\) vertices is a median graph. We show that the complexity of checking whether \(G\) is triangle-free is at most \(O(M(m,m))\). Conversely, we prove that the complexity of checking whether a given graph is a median graph is at most \(O(m \log n + T(m \log n,n)
Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder   +2 more
openaire   +3 more sources

CYCLES IN TRIANGLE-FREE GRAPHS

Discrete Mathematics, Algorithms and Applications, 2011
Let G be a k-connected (k ≥ 3), triangle-free graph with α(G) ≤ k + 1. If G is not Petersen graph and G ∉ {Kk, k, Kk, k + 1, Kk + 1, k+1}, then G contains cycles of lengths from 4 to |V(G)|. This generalizes a result conjectured by Amar et al. (Graphs Combin.7 (1991)) and proved by Lou (Discrete Math.152 (1996)).
Xiaojuan Li, Bing Wei 0001, Yongjin Zhu
openaire   +2 more sources

A conjecture on triangles of graphs

Graphs and Combinatorics, 1990
The author conjectured in 1981: If a grah G does not contain more than k pairwise edge-disjoint triangles, then there exists a set of at most 2k edges that meets all triangles of G. In the paper this conjecture is proved for various classes of graphs (planar graphs, graphs with n vertices and at least \((7/16)n^ 2\) edges, chordal graphs without a ...
openaire   +1 more source

Triangle graphs and their coloring

2005
In this paper, we present results on two subclasses of trapezoid graphs, including simple trapezoid graphs and triangle graphs (also known as PI graph in [3]). Simple trapezoid graphs and triangle graphs are proper subclasses of trapezoid graphs [5, 3].
openaire   +1 more source