Results 91 to 100 of about 1,773 (109)

Note on Polychromatic Coloring of Hereditary Hypergraph Families. [PDF]

Graphs Comb
Pálvölgyi D.
europepmc   +1 more source

Monochromatic Infinite Sets in Minkowski Planes. [PDF]

Discrete Comput Geom
Frankl N, Gehér P, Gehér P, Sagdeev A, Tóth G.   +4 more
europepmc   +1 more source

Homogeneous isosceles-free spaces. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Bargetz C, Bartoš A, Kubiś W, Luggin F.   +3 more
europepmc   +1 more source

Enhancement of yogurt functionality by adding Mentha piprita phenolic extract and evaluation of its quality during cold storage. [PDF]

Food Sci Nutr
Guemidi C, Ait Saada D, Ait Chabane O, Elmastas M, Erenler R, Yilmaz MA, Tarhan A, Akkal S, Khelifi H.   +8 more
europepmc   +1 more source

OxyR is required for oxidative stress resistance of the entomopathogenic bacterium Xenorhabdus nematophila and has a minor role during the bacterial interaction with its hosts. [PDF]

Microbiology (Reading)
Bientz V, Lanois A, Ginibre N, Pagès S, Ogier JC, George S, Rialle S, Brillard J.   +7 more
europepmc   +1 more source

On (p, 1)-total labelling of 1-planar graphs

Open Mathematics, 2011
Zhang Xin, Yu Yong, Liu Guizhen
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

NOTES ON THE HARMONIC INDEX OF GRAPHS

Rocky Mountain Journal of Mathematics, 2022
For a connected graph G of order n, the harmonic index of G is the sum of weights 2 d(u)+d(v) over all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this note, we prove that H(G) ≥ χDP (G)− 2 2 + 2(χDP (
Yirong Zheng, Jianbo Lv, Jianxi Li
semanticscholar   +1 more source

Packing chromatic number of the join of some classes of graphs

International Mathematical Forum, 2022
Let G be a graph. A packing k-coloring of G is a function f : V (G)→ {1, 2, . . . , k} such that any two vertices of color i are at a distance at least i + 1.
Alje Marie M. Urenda, Jacel Angeline V. Lingcong, Normina A. Batucan, Joel G. Adanza, Michael P. Baldado Jr.   +4 more
semanticscholar   +1 more source

On the k-friendly index of graphs

, 2020
Let G = (V, E) be a graph and f : V → Z2 be a vertex labeling. Define f+ : E → Z2 by f+(uv) = f(u) + f(v). For each i ∈ Z2, define vf (i) = |{v ∈ V : f(v) = i}| and ef (i) = ∣∣{e ∈ E : f+(e) = i}∣∣.
Rosario C. Abrasaldo, M. P. Baldado
semanticscholar   +1 more source

HANDLE DECOMPOSITION FOR A CLASS OF COMPACT ORIENTABLE PL 4-MANIFOLDS

Matematički Vesnik
In this article we study a particular class of compact connected orientable PL 4manifolds with empty or connected boundary which have infinite cyclic fundamental group.
Biplab Basak, Manisha Binjola
semanticscholar   +1 more source