Note about the upper chromatic number of mixed hypertrees
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 distin...
Main Authors: | Kenneth Roblee, Vitaly Voloshin |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2005-10-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/files/csjm/v13-n2/v13-n2-(pp131-135).pdf |
Similar Items
-
Lower and upper chromatic numbers for BSTSs(2h - 1)
by: Marco Buratti, et al.
Published: (2001-08-01) -
On the upper chromatic index of a multigraph
by: Mario Gionfriddo, et al.
Published: (2002-01-01) -
The Chromatic Spectrum of a Ramsey Mixed Hypergraph
by: David Slutzky, et al.
Published: (2016-08-01) -
An upper bound for the chromatic number of line graphs
by: Andrew D. King, et al.
Published: (2005-01-01) -
On cordial labeling of hypertrees
by: Michał Tuczyński, et al.
Published: (2019-08-01)