Sciweavers

Share
33 search results - page 1 / 7
» On Feasible Sets of Mixed Hypergraphs
Sort
View
GC
2016
Springer
3 years 11 months ago
Spectrum of Mixed Bi-uniform Hypergraphs
A mixed hypergraph is a triple H = (V, C, D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored...
Maria Axenovich, Enrica Cherubini, Torsten Ueckerd...
GC
2002
Springer
9 years 3 months ago
The Chromatic Spectrum of Mixed Hypergraphs
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Vol...
FCT
2005
Springer
9 years 9 months ago
Path Coupling Using Stopping Times
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
9 years 3 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
books