Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Note about the upper chromatic number of mixed hypertrees
Authors: Kenneth Roblee, Vitaly Voloshin
– 0.11 Mb
Abstract
A mixed hypergraph is a triple H=(X,C,D), where X is the vertex set and each of C,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:→[k] such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. Upper chromatic number is the maximum number of colors that can be used in a proper coloring. A mixed hypergraph H is called a mixed hypertree if there exists a host tree on the vertex set X such that every edge (C- or D-) induces a connected subtree of this tree. We show that if a mixed hypertree can be decomposed into interval mixed hypergraphs then the upper chromatic number can be computed using the same formula.K. Roblee, V. Voloshin
Department of Mathematics and Physics,
Troy University,
Troy, Alabama, USA
E-mail:
Department of Mathematics and Physics,
Troy University,
Troy, Alabama, USA
E-mail:
Fulltext
– 0.11 Mb
Contents
- Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
- Note about the upper chromatic number of mixed hypertrees
- Nash equilibria sets in mixed extended 2x3 games
- Involving d-Convex Simple and Quasi-simple Planar Graphs in R3
- Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
- Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics
- Approaches to Software Based Fault Tolerance -- A Review
- Interfaces to symbolic computation systems: reconsidering experience of Bergman
