Results 101 to 110 of about 4,061 (147)

Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review. [PDF]

Pharmacol Ther, 2013
Csermely P, Korcsmáros T, Kiss HJ, London G, Nussinov R.   +4 more
europepmc   +1 more source

Effective data visualization strategies in untargeted metabolomics.

Nat Prod Rep
Mildau K, Ehlers H, Meisenburg M, Del Pup E, Koetsier RA, Torres Ortega LR, de Jonge NF, Singh KS, Ferreira D, Othibeng K, Tugizimana F, Huber F, van der Hooft JJJ.   +12 more
europepmc   +1 more source

Hypergraph coloring complexes.

Discrete Math, 2012
Breuer F, Dall A, Kubitzke M.
europepmc   +1 more source

Coloring of planar graphs and its relations to hypergraph coloring

Coloring of planar graphs and its relations to hypergraph coloring
openaire  

ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS

The Quarterly Journal of Mathematics, 1993
In the paper, \(k\)-local and \(k\)-mean colorings of graphs and hypergraphs are studied. Given an edge-coloring \(f\) and a vertex \(v\), \(\alpha_ f(v)\) denotes the number of distinct colors that appear on the edges incident with \(v\). A coloring \(f\) is \(k\)-local if for every vertex \(v\), \(\alpha_ f(v) \leq k\). A coloring \(f\) is \(k\)-mean
Caro, Yair, Tuza, Zsolt
semanticscholar   +4 more sources

On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph

Discrete Mathematics, Algorithms and Applications, 2015
For a graph G = (V, E) and a nonempty set X, a linear hypergraph set-indexer (LHSI) is a function f : V(G) → 2X satisfying the following conditions: (i) f is injective (ii) the ordered pair Hf(G) = (X, f(V)), where f(V) = {f(v) : v ∈ V(G)}, is a linear hypergraph (iii) the induced function f⊕ : E → 2X defined by f⊕(uv) = f(u) ⊕ f(v), for all uv ∈ E is
Viji Paul, K A Germina
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A Simplified Mathematical Study of Local Computation Algorithms for Efficient Hypergraphs Coloring

Journal of Al-Qadisiyah for Computer Science and Mathematics
This paper presents a comprehensive mathematical exploration of local computation algorithms specifically tailored for efficient hypergraph coloring.
Ikram Hussein Khafeef
semanticscholar   +1 more source