About perfection of circular mixed hypergraphs
Abstract
A mixed hypergraph is a triple H = (X,C,D), where X is the vertex set and each of C and D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is a mapping c : X → {1,...,k} such that each C-edge has two vertices with a common color and each D-edge has two vertices with different colors. Maximum number of colors in a coloring using all the colors is called upper chromatic number χ ̄(H). Maximum cardinality of subset of vertices which contains no C-edge is C-stability number αC (H). A mixed hypergraph is called C-perfect if χ ̄ (H') = αC (H') for any induced subhypergraph H'. A mixed hyper- graph H is called circular if there exists a host cycle on the vertex set X such that every edge (C- or D-) induces a connected subgraph on the host cycle. We give a characterization of C-perfect circular mixed hypergraphs.
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.