Abstract
We survey results and open problems on ‘mixed hypergraphs’ that are hypergraphs with two types of edges. In a proper vertex coloring the edges of the first type must not be monochromatic, while the edges of the second type must not be completely multicolored. Though the first condition just means ‘classical’ hypergraph coloring, its combination with the second one causes rather unusual behavior. For instance, hypergraphs occur that are uncolorable, or that admit colorings with certain numbers k′ and k″ of colors but no colorings with exactly k colors for any k′ < k < k″.
Research supported in part by the Hungarian Scientific Research Fund, OTKA grant T-049613.
Partially supported by Troy University Research Grant.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Bacsó and Zs. Tuza, Upper chromatic number of finite projective planes, J. Corn-bin. Designs, to appear.
G. Bacsó, Zs. Tuza and V. Voloshin, Unique colorings of bi-hypergraphs, Australasian J. Combin., 27 (2003), 33–45.
C. Berge, Hypergraphs: Combinatorics of Finite Sets, North Holland (1989).
Cs. Bujtás and Zs. Tuza, Orderings of uniquely colorable mixed hypergraphs, Discrete Applied Math., 155 (2007), 1395–1407.
Cs. Bujtás and Zs. Tuza, Mixed colorings of hypergraphs, Electronic Notes in Discrete Mathematics, 24 (2006), 273–275.
Cs. Bujtás and Zs. Tuza, Uniform mixed hypergraphs: The possible numbers of colors, Graphs Combin., to appear.
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, I: General results. Manuscript (2006).
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Manuscript (2006).
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, III: Model comparison, Applicable Analysis and Discrete Math., 1 (2007), 36–55.
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, IV: Stable colorings of hypertrees (in preparation).
Cs. Bujtás and Zs. Tuza, C-perfect hypergraphs (in preparation).
E. Bulgaru and V. Voloshin, Mixed interval hypergraphs, Discrete Applied Math., 77(1) (1997), 24–41.
M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, The strong perfect graph theorem, Annals of Math., 164(1) (2006), 51–229.
K. Diao, P. Zhao and H. Zhou, About the upper chromatic number of a co-hypergraph, Discrete Math., 220 (2000), 67–73.
K. Diao, G. Liu, D. Rautenbach and P. Zhao, A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2, Discrete Math., 306 (2006), 670–672.
E. Drgas-Burchardt and E. Łazuka, On chromatic polynomials of hypergraphs, Applied Math. Letters, to appear.
Dvořák, Z., J. Kára, D. Král’ and O. Pangrác, Pattern hypergraphs. Manuscript (2004).
E. Flocos, Proprietati cromatice ale co-monostelelor, Buletinul Academiei de Stiinte a RM, Matematica, Chisinau (1997), No. 3, pp. 8–19. (in Romanian).
B. Ganter, private communication (1997).
L. Gionfriddo, Voloshin’s colourings of P 3-designs, Discrete Math., 275 (2004), 137–149.
M. Gionfriddo, Colourings of hypergraphs and mixed hypergraphs, Rendiconti del Seminario Matematico di Messina. Serie II, Tomo XXV, Vol. 9 (2003), 87–98.
M. Gionfriddo, L. Milazzo and V. Voloshin, On the upper chromatic index of a multigraph, Computer Sci. J. Moldova, 10(1) [28] (2002), 81–91.
T. Jiang, D. Mubayi, V. Voloshin, Zs. Tuza and D.B. West, The chromatic spectrum of mixed hypergraphs, Graphs Combin., 18 (2002), 309–318.
D. Kobler and A. Kündgen, Gaps in the chromatic spectrum of face-constrained plane graphs, Electron. J. Combin., 8(1) (2001), #N3.
D. Král’, A counter-example to Voloshin’s hypergraph co-perfectness conjecture, Australasian J. Combin., 27 (2003), 25–41.
D. Král’, On feasible sets of mixed hypergraphs, Electron. J. Combin., 11(1) (2004), #R19.
D. Král’, Mixed Hypergraphs and other coloring problems, Discrete Math., 307(7–8) (2007), 923–938.
D. Král’, J. Kratochvíl, A. Proskurowski and H.-J. Voss, Coloring mixed hypertrees, Discrete Applied Mathematics, 154(4) (2006), 660–672.
D. Král’, J. Kratochvíl and H.-J. Voss, Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs, Theoretical Computer Science, 295(1–3) (2003), 263–278.
D. Král’, J. Kratochvíl and H.-J. Voss, Mixed hypercacti, Discrete Math., 286(1–2) (2004), 99–113.
J. Kratochvíl, Zs. Tuza and M. Voigt, New trends in the theory of graph colorings: Choosability and list coloring, in: Contemporary Trends in Discrete Mathematics (R. L. Graham et al., eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 49, Amer. Math. Soc. (1999), pp. 183–197.
A. Kündgen, E. Mendelsohn and V. I. Voloshin, Coloring of planar mixed hypergraphs, Electron. J. Combin., 7 (2000), #R60.
G. Lo Faro, L. Milazzo and A. Tripodi, The first BSTS with different lower and upper chromatic numbers, Australasian J. Combin., 22 (2000), 123–133.
D. Lozovanu and V. Voloshin, Integer programming models for colorings of mixed hypergraphs, Computer Sci. J. Moldova, 8 (2000), 64–74.
L. Milazzo and Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math., 174 (1997), 247–259.
L. Milazzo and Zs. Tuza, Strict colourings for classes of Steiner triple systems, Discrete Math., 182 (1998), 233–243.
L. Milazzo and Zs. Tuza, Logarithmic upper bound for the upper chromatic number of S(t, t + 1, v) systems. Manuscript (2004).
L. Milazzo, Zs. Tuza and V. I. Voloshin, Strict colorings of Steiner triple and quadruple systems: a survey, Discrete Math., 261 (2003), 399–411.
A. Niculitsa and V. Voloshin, About uniquely colorable mixed hypertrees, Discuss. Math. Graph Theory, 20(1) (2000), 81–91.
A. Niculitsa and H.-J. Voss, A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n − 1 and n − 2, Australasian J. Combin., 21 (2000), 167–177.
V. Prisakaru, The upper chromatic number of quasi-interval co-hypergraphs, Le Mathematiche, LII (1997)-Fasc. II, 237–260.
Zs. Tuza, Graph colorings with local constraints — A survey, Discuss. Math. Graph Theory, 17(2) (1997), 161–228.
Zs. Tuza and V. I. Voloshin, Uncolorable mixed hypergraphs, Discrete Applied Math., 99 (2000), 209–227.
Zs. Tuza, V. I. Voloshin and H. Zhou, Uniquely colorable mixed hypergraphs, Discrete Math., 248 (2002), 221–236.
V. I. Voloshin, The mixed hypergraphs, Computer Sci. J. Moldova, 1 (1993), 45–52.
V. I. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Combin., 11 (1995), 25–45.
V. I. Voloshin, Coloring Mixed Hypergraphs: Theory, Algorithms and Applications, Fields Institute Monograph, Amer. Math. Soc. (2002).
V. Voloshin, Mixed Hypergraph Coloring Web Site: http://spectrum.troy.edu/∼voloshin/mh.html
V. Voloshin and H.-J. Voss, Circular mixed hypergraphs I: colorability and unique colorability, in: Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2000, Congr. Numer., 144 (2000), pp. 207–219.
V. I. Voloshin and H. Zhou, Pseudo-chordal mixed hypergraphs, Discrete Math., 202 (1999), 239–248.
A. A. Zykov, Hypergraphs, Uspekhi Mat. Nauk, 29 (1974), 89–154. (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Tuza, Z., Voloshin, V. (2008). Problems and Results on Colorings of Mixed Hypergraphs. In: Győri, E., Katona, G.O.H., Lovász, L., Sági, G. (eds) Horizons of Combinatorics. Bolyai Society Mathematical Studies, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77200-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-77200-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77199-9
Online ISBN: 978-3-540-77200-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)