Colouring polytopic partitions in $\mathbb{R}^d$
نویسندگان
چکیده
منابع مشابه
Colouring Polytopic Partitions in �
We consider face-to-face partitions of bounded polytopes into convex polytopes in d for arbitrary d 1 and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed d+1. Partitions of polyhedra in 3 into pentahedra and hexahedra are 5and 6-colourable, respectively. We show that the above numbers are attainable, i.e., in general, th...
متن کاملPolytopic multiplexing.
Polytopic multiplexing is a new method of overlapping holograms that, when combined with other multiplexing techniques, can increase the capacity of a volume holographic data storage system by more than a factor of 10. This is because the method makes possible the effective utilization of thick media. An experimental demonstration of this technique is also presented.
متن کاملColouring graphs with bounded generalized colouring number
Given a graph G and a positive integer p, χp(G) is the minimum number of colours needed to colour the vertices of G so that for any i ≤ p, any subgraph H of G of tree-depth i gets at least i colours. This paper proves an upper bound for χp(G) in terms of the k-colouring number colk(G) of G for k = 2p−2. Conversely, for each integer k, we also prove an upper bound for colk(G) in terms of χk+2(G)...
متن کاملEdge-colouring and total-colouring chordless graphs
A graph G is chordless if no cycle in G has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it to establish that every chordless graph of maximum degree ∆ ≥ 3 has chromatic index ∆ and total chromatic number ∆+1. The proofs are algorithmic in the sense that we ac...
متن کاملPolytopic Cryptanalysis
Standard differential cryptanalysis uses statistical dependencies between the difference of two plaintexts and the difference of the respective two ciphertexts to attack a cipher. Here we introduce polytopic cryptanalysis which considers interdependencies between larger sets of texts as they traverse through the cipher. We prove that the methodology of standard differential cryptanalysis can un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Bohemica
سال: 2002
ISSN: 0862-7959,2464-7136
DOI: 10.21136/mb.2002.134161