Colouring of Voloshin for ATS(v)
Abstract
A mixed hypergraph is a triple H=(S,C,D), where S is the vertex set and each of C,D is a family of not-empty subsets of S, the C-edges and D-edges respectively. A strict k-colouring of H is a surjection f from the vertex set into a set of colours {1, 2, . . . , k} so that each C-edge contains at least two distinct vertices x, y such that f(x) = f(y) and each D-edge contains at least two vertices x, y such that f(x)=f(y). For each k ∈ {1, 2, . . . , |S|}, let r_k be the number of partitions of the vertex set into k not-empty parts (the colour classes) such that the colouring constraint is satisfied on each C-edge and D-edge. The vector R(H ) = (r_1 , . . . , r_k ) is called the chromatic spectrum of H. These concepts were introduced by V. Voloshin in 1993 [6].In this paper we examine colourings of mixed hypergraphs in the case that H is an ATS(v).
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
