Results 141 to 150 of about 351 (173)

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

open access: yesPharmacol Ther, 2013
Csermely P   +4 more
europepmc   +1 more source

Hypergraph coloring complexes.

open access: yesDiscrete Math, 2012
Breuer F, Dall A, Kubitzke M.
europepmc   +1 more source

Coloring of planar graphs and its relations to hypergraph coloring

open access: yesColoring of planar graphs and its relations to hypergraph coloring
openaire   +1 more source

Local k-Colorings of Graphs and Hypergraphs

open access: yesJournal of Combinatorial Theory Series B, 1987
A local k-coloring of a graph is a coloring of its edges such that the edges incident with any vertex are colored with at most k different colors. In this paper similarities and differences between usual and local k-coloring are investigated with respect to Ramsey type problems.
Jaroslav Nešetřil   +2 more
exaly   +4 more sources

Adapted List Coloring of Graphs and Hypergraphs [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ...
Xuding Zhu, Alexandr Kostochka
exaly   +2 more sources

On the Connectivity of Proper Colorings of Random Graphs and Hypergraphs

open access: yesRandom Structures and Algorithms, 2020
Let Ωq=Ωq(H) denote the set of proper [q]‐colorings of the hypergraph H. Let Γq be the graph with vertex set Ωq where two colorings σ,τ are adjacent iff the corresponding colorings differ in exactly one vertex. We show that if H=Hn,m;k, k ≥ 2, the random k‐uniform hypergraph with V=[n] and m=dn/k hyperedges then w.h.p.
Alan M. Frieze
exaly   +5 more sources

Coloring General Kneser Graphs and Hypergraphs via High-Discrepancy Hypergraphs [PDF]

open access: yesEuropean Journal of Combinatorics, 2019
9 ...
Danila Cherkashin   +2 more
exaly   +5 more sources
Some of the next articles are maybe not open access.

Dimension, Graph and Hypergraph Coloring

Order, 2000
A linear extension \(L\) of a poset \(P\) reverses an incomparable pair \((x,y)\) of \(P\) if \(x>y\) in \(L\). A set \(S\) of incomparable pairs forms a strict alternating cycle of \(P\) if no linear extension of \(P\) reverses all pairs in \(S\) but for all \(T \subset S\) there is a linear extension of \(P\) which reverses all pairs in \(T\).
Stefan Felsner, William T. Trotter
openaire   +2 more sources

Home - About - Disclaimer - Privacy