Sciweavers

4 search results - page 1 / 1
» Set maps, umbral calculus, and the chromatic polynomial
Sort
View
DM
2008
107views more  DM 2008»
13 years 9 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman
JGT
2008
97views more  JGT 2008»
13 years 10 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
13 years 10 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...
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 5 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig