Publications related to Mixed Hypergraph Coloring

      2024

    1. Gu, Ran; Lei, Hui; Shi, Yongtang; Wang, Yiqiao; A note on rainbow-free colorings of uniform hypergraphs. Discrete Appl. Math. 344 (2024), 161–169.

      2023

    2. Meiqiao Zhang, Fengming Dong, and Ruixue Zhang. On the colorability of bi-hypergraphs.

    3. Chudnovsky, M., Kalai, G. Attempting perfect hypergraphs. Isr. J. Math. 256, 133–151 (2023). https://doi.org/10.1007/s11856-023-2506-8 (Full text)

    4. Krul, Michael; Thoma, Luboš; An Algebraic Formulation of Hypergraph Colorings. Electron. J. Combin. 30 (2023), no. 2, Paper No. 2.39–.

    5. Péter Bence Czaun, Pál Pusztai, Levente Sebők and Zsolt Tuza. Minimal Non-C-Perfect Hypergraphs with Circular Symmetry. Symmetry 2023, 15(5), 1114.

      2022

    6. Bonacini, Paola (I-CATN-MI); Marino, Lucia (I-CATN-MI); Edge balanced star-hypergraph designs and vertex colorings of path designs. J. Combin. Des. 30 (2022), no. 7, 497–514.

    7. Zhang R., Dong F., Zhang M. Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs. Mathematics. 2022; 10(2):193. https://doi.org/10.3390/math10020193

      8. 2021

    8. R.G. Koerkamp, S. Zivny. On rainbow-free colourings of uniform hypergraphs. Theoretical Computer Science Volume 885, 11 September 2021, Pages 69-76.

    9. Dósa, Gy.; Newman, N.; Tuza, Zs.; Voloshin, V. Coloring properties of mixed cycloids. Symmetry 2021, 13(8), 1539.

    10. N. Newman, V. Voloshin, H.-J. Voss. About perfection of circular mixed hypergraphs. Le Matematiche, Vol. LXXVI (2021) – Issue I, pp. 97–107.

    11. Barber, Ben (4-MANC). The Namer-Claimer game. Discrete Math. 344 (2021), no. 3, 112256, 6 pp.

    12. Blázsik, Zoltán L. (H-AOS); Blokhuis, Aart (NL-EIND-NDM); Miklavič, Štefko (SV-UPR-IAM); Nagy, Zoltán Lóránt (H-EOTVO-GAC); Szőnyi, Tamás (H-EOTVO-GAC) On the balanced upper chromatic number of finite projective planes. Discrete Math. 344 (2021), no. 3, 112266, 8 pp.

    13. Newman, N.; Voloshin, V. Colorings of (r, r)-Uniform, Complete, Circular, Mixed Hypergraphs. Mathematics 2021, 9, 828.

      14. 2020

    14. RUIXUE ZHANG. CHROMATIC POLYNOMIALS OF HYPERGRAPHS AND MIXED HYPERGRAPHS. PhD Thesis, NATIONAL INSTITUTE OF EDUCATION, NANYANG TECHNOLOGICAL UNIVERSITY, SINGAPORE, 2020, 203 p.

    15. R. Zhang, F. Dong. Zero-free intervals of chromatic polynomials of hypergraphs. Discrete Mathematics, 343(12) December 2020, 112134.

    16. P. Bonacini, L. Marino. On Voloshin colorings in 3-hypergraph designs. Discrete Mathematics, Volume 343, Issue 10, October 2020.

    17. Y. Zhu, Y.Xiong. The Maximum Number of Hyperedges of An r-Uniform D-Hypergraph. Advances in Applied Mathematics, Vol. 09 No. 01 ( 2020 ), Article ID: 33972, 4 pages.

      18. 2019

    18. J. Allagan, V. Voloshin. F-WORM colorings of some 2-trees: partition vectors. ARS MATHEMATICA CONTEMPORANEA 16 (2019) 173–182.

    19. N. Newman, K. Roblee, V. Voloshin. About colorings of (3,3)-uniform complete circular mixed hypergraphs. CONGRESSUS NUMERANTIUM, 233 (2019), pp. 189-194.

    20. M. Gionfriddo, V. Voloshin. In memory of Lorenzo Milazzo, 1963-2019. Bulletin of the Institute of Combinatorics and its Applications, Volume 87, October 2019, p. 8-13.

    21. S. Bhandari, V.Voloshin. Upper chromatic number of n-dimensional cube. Alabama Journal of Mathematics, 43 (2019), pp.1-5.

    22. Zs. Tuza. Mixed hypergraphs and beyond. The Art of Discrete and Applied Mathematics 1(2018) #P2.05. Published online July 9, 2019.

    23. V.Voloshin. Mario Gionfriddo and mixed hypergraph coloring. The Art of Discrete and Applied Mathematics 1(2018) #P2.06. Published online July 14, 2019.

    24. Kefeng Diao, Fuliang Lu, Ping Zhao. More Results on The Smallest One-Realization of A Given Set II. Discussiones Mathematicae Graph Theory 39 (2019) 473-487.

      25. 2018

    25. R. Zhang and F. Dong. Zero-free intervals of chromatic polynomials of mixed hypergraphs.

    26. Ping Zhao, Fuliang Lu, Vitaly Voloshin, Kefeng Diao. On the Structure of Uniform One-Realizations of a Given Set. Graphs Combin. 34 (2018), no. 1, 129–138.

      27. 2017

    27. Slutzky, David. Recursive formulae for the chromatic polynomials of complete r-uniform mixed interval hypergraphs. Ars Combin. 134 (2017), 303–324. MR3677170

    28. Csilla Bujtas, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Zsolt Tuza, Vitaly Voloshin. Extended Bicolorings of Steiner Triple Systems of Order 2^h − 1. TAIWANESE JOURNAL OF MATHEMATICS, Vol. 21, No. 6, pp. 1265 – 1276, December 2017.

    29. MR3636878 Czap, Július(SK-KTUE-AME); Jendrol', Stanislav(SK-SFRK-IM); Valiska, Juraj(SK-SFRK-IM). Worm colorings of planar graphs. Discuss. Math. Graph Theory 37 (2017), no. 2, 353–368.

    30. MR3646700 Janicová, Mária(SK-SFRKFS); Madaras, Tomáš(SK-SFRKFS); Soták, Roman(SK-SFRKFS); Lužar, Borut. From NMNR-coloring of hypergraphs to homogenous coloring of graphs. Ars Math. Contemp. 12 (2017), no. 2, 351–360.

    31. Paola Bonacini, Mario Gionfriddo, and Lucia Marino. BLOCK COLOURINGS OF 6-CYCLE SYSTEMS. Opuscula Math. 37, no. 5 (2017), 647–664.

    32. Kefeng Diao, Fuliang Lu, Vitaly Voloshin, Ping Zhao. The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. Graphs and Combinatorics, 2017, pp.1-15 (available online).

      2016

    33. Kefeng Diao, Fuliang Lu, Ping Zhao. MORE RESULTS ON THE SMALLEST ONE-REALIZATION OF A GIVEN SET. Graphs and Combinatorics. March 2016, Volume 32, Issue 2, pp 835–850.

    34. Bujtás, Csilla; Tuza, Zsolt. K3-worm colorings of graphs: lower chromatic number and gaps in the chromatic spectrum. Discuss. Math. Graph Theory 36 (2016), no. 3, 759–772.

    35. Axenovich, Maria; Cherubini, Enrica; Ueckerdt, Torsten. Spectrum of mixed bi-uniform hypergraphs. Graphs Combin. 32 (2016), no. 2, 453–461.

    36. Luther, Robert D.; Pike, David A. Equitably colored balanced incomplete block designs. J. Combin. Des. 24 (2016), no. 7, 299–307.

    37. D. Slutzky, V. Voloshin. The Chromatic Spectrum of a Ramsey Mixed Hypergraph. Computer Science Journal of Moldova, vol. 24, no.2(71), 2016, pp. 213-233.

    38. Chandler, James D.; Desormeaux, Wyatt J.; Haynes, Teresa W.; Hedetniemi, Stephen T. Neighborhood-restricted [≤2]-achromatic colorings. Discrete Appl. Math. 207 (2016), 39–44.

    39. H. Zhang, L. Song, Z. Han. Radio Resource Allocation for Device-to-Device Underlay Communication Using Hypergraph Theory. IEEE Transactions on Wireless Communications (Volume:15, Issue: 7, 2016).

    40. Chuanyou Li; Michel Hurfin; Yun Wang; Lei Yu. Towards a Restrained Use of Non-Equivocation for Achieving Iterative Approximate Byzantine Consensus. 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

    41. M. Axenovich, A. Karrer. High girth hypergraphs with unavoidable monochromatic or rainbow edges.

    42. Honghai Xu. Generalized Colorings of Graphs. PhD Thesis. Clemson University, 2016

    43. J. Chandler. Neighborhood-Restricted Achromatic Colorings of Graphs. PhD Thesis. East Tennessee State University, 2016.

    44. J. Allagan, V. Voloshin. Coloring k-trees with forbidden monochrome and rainbow triangles. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 65(2) (2016), Pages 137–151.

    45. Kefeng Diao, Vitaly Voloshin, Bing Xue, Ping Zhao. On perfection and imperfection of one-realizations of a given set. Discrete Mathematics 339 (2016) 2417–2422.

      2015

    46. Zhang, Ruixue (PRC-LYU-SSC); Zhao, Ping (PRC-LYU-SSC); Diao, Kefeng (PRC-LYU-SSC); Lu, Fuliang (PRC-LYU-SSC) The minimum chromatic spectrum of 3-uniform C-hypergraphs. (English summary) J. Comb. Optim. 29 (2015), no. 4, 796–802.

    47. Bujtás, Csilla(H-PAN-CST); Tuza, Zsolt(H-PAN-CST) Maximum number of colors in hypertrees of bounded degree. CEJOR Cent. Eur. J. Oper. Res. 23 (2015), no. 4, 867–876.

    48. Cs. Bujtas, Zs. Tuza. F-WORM colorings: Results for 2-connected graphs.

    49. MR3308543 Goddard, Wayne; Wash, Kirsti; Xu, Honghai. WORM colorings forbidding cycles or cliques. Congr. Numer. 219 (2014), 161-173.

    50. MR3368990 Goddard, Wayne; Wash, Kirsti; Xu, Honghai. Worm colorings. Discuss. Math. Graph Theory 35 (2015), no. 3, 571–584

    51. Yair Caro, Josef Lauri, Christina Zarb. Constrained Colouring and σ-Hypergraphs. Discussiones Mathematicae Graph Theory. Volume 35, Issue 1, Pages 171–189.

    52. Yair Caro, Josef Lauri, Christina Zarb. (2,2)-colourings and clique-free σ-hypergraphs. Discrete Applied Mathematics, Volume 185, 20 April 2015, Pages 38–43.

    53. M. Axenovich, E. Cherubini, T. Ueckerdt. Spectrum of Mixed Bi-uniform Hypergraphs. Graphs and Combinatorics · July 2015. DOI: 10.1007/s00373-015-1586-6.

    54. Ping Zhao, Kefeng Diao, Fuliang Lu. More Result on the Smallest One-Realization of a Given Set. Graphs and Combinatorics. Published online, July 16, 2015.

    55. Gabriela Araujo-Pardoa, György Kiss, Amanda Montejano. On the balanced upper chromatic number of cyclic projective planes and projective spaces. Discrete Mathematics Volume 338, Issue 12, 6 December 2015, Pages 2562–2571.

    56. Cs. Bujtas, Zs. Tuza. Approximability of the upper chromatic number of hypergraphs. Discrete Mathematics, Volume 338, Issue 10, 6 October 2015, Pages 1714–1721.

    57. Chapter 11: "Hypergraph Colouring", by Cs. Bujtas, Zs. Tuza and V. Voloshin, in “Topics in Chromatic Graph Theory”, edited by L.W. Beineke and R. J. Wilson; Cambridge University Press, 2015, p. 230-254.

    58. Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao. The smallest one-realization of a given set IV. Discrete Mathematics, Volume 338, Issue 5, 6 May 2015, Pages 712-724.

    59. Xiao Zhu, Xiaoxiao Duan. The smallest 3-uniform bi-hypergraph which is a realization of a given vector. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 61(2) (2015), Pages 182–191.

      2014

    60. MR3227047 Allagan, Julian A., Slutzky, David. Chromatic polynomials of mixed hypercycles. Discuss. Math. Graph Theory 34 (2014), no. 3, 547–558.

    61. Diao, Kefeng; Zhao, Ping; Wang, Kaishun The smallest one-realization of a given set III. Graphs Combin. 30 (2014), no. 4, 875–885. 05C15 (05C65)

    62. Cs. Bujtas, Zs. Tuza. Maximum number of colors in hypertrees of bounded degree. Central European Journal of Operations Research, published online 29 July 2014.

    63. A. Axenovich, E. Cherubini, T. Ueckerdt. Spectrum of mixed bi-uniform hypergraphs.

    64. M. Gionfriddo, V. Voloshin. Bihypergraphs and G-Designs with Broken Chromatic Spectrum: Results and Problems. Applied Mathematical Sciences, Vol. 8, 2014, no. 74, 3673 - 3682.

    65. M. Gionfriddo, E. Guardo, L. Milazzo, V. Voloshin. Feasible sets of small bicolorable STSs. Australasian Journal of Combinatoris, 59 (1) (2014), pp.107-119.

    66. Y. Caro, J. Lauri, C. Zarb. (2,2)-colorings and clique-free sigma-hypergraphs.

    67. Jihong Liu, Jingge Bai, Wenai Xu, Ping Zhao. On the Feasible Sets of Products of bi-hypergraphs. International Journal of Computer and Information Technology, Volume 03 – Issue 01, January 2014.

    68. J. Allagan, D. Slutzky. Chromatic polynomials of some mixed hypergraphs. Australasian Journal of Combinatorics, Volume 58(1) (2014), 197-213.

      2013

    69. Csilla Bujtás, Zsolt Tuza. Approximability of the upper chromatic number of hypergraphs. Published online.

    70. M. Gionfriddo, E. Guardo, L. Milazzo: EXTENDING BICOLORINGS FOR STEINER TRIPLE SYSTEMS. Applicable Analysis and Discrete Mathematics, 7 (2013), 225–234.

    71. J. Lauri and L. Gionfriddo. Voloshin colourings of mixed hypergraphs derived from graphs. In: "Recent Results in Designs and Graphs: a Tribute to Lucia Gionfriddo", Quaderni di Matematica, volume 28, edited by Dipartimento di Matematica e Fisica Seconda Università degli Studi di Napoli. Editors: Marco Buratti, Curt Lindner, Francesco Mazzocca and Nicola Melone. P. 351-362, Napoli, 2012.

    72. M. Gionfriddo, A. Lizzio, L. Milazzo and V. Voloshin. Upper chromatic number and strict colorings of quadruple systems. In: "Recent Results in Designs and Graphs: a Tribute to Lucia Gionfriddo", Quaderni di Matematica, volume 28, edited by Dipartimento di Matematica e Fisica Seconda Università degli Studi di Napoli. Editors: Marco Buratti, Curt Lindner, Francesco Mazzocca and Nicola Melone. P. 339-350, Napoli, 2012.

    73. Y. Caro, J. Lauri. Non-monochromatic non-rainbow colourings of sigma-hypergraphs.

    74. K. Diao, V. Voloshin, K. Wang, P. Zhao. The smallest one-realization of a given set IV. Submitted.

    75. G. Bacso, T. Heger, T. Szonyi. The 2-Blocking Number and the Upper Chromatic Number of PG(2,q). Journal of Combinatorial Designs, published online 10 APR 2013.

    76. S. Sen. New Systems and Algorithms for Scalable Fault Tolerance. PhD Thesis, Princeton University, 2013, 154 p.

    77. Ruixue Zhang, Ping Zhao, Kefeng Diao, Fuliang Lu. The minimum chromatic spectrum of 3-uniform C-hypergraphs. Journal of Combinatorial Optimization, published online May 15, 2013.

    78. Kefeng Diao, Ping Zhao, Kaishun Wang. The Smallest One-Realization of a Given Set III. Graphs and Combinatorics, published online May 10, 2013.

      2012

    79. MR2986360 Zheng, Guo Biao. Generalized extension of one result on the upper chromatical number of D-complete uniform mixed hypergraphs. (Chinese) Pure Appl. Math. (Xi'an) 28 (2012), no. 3, 294–302. 05C15 (05C65)

    80. M. Hegyhati, Zs. Tuza. Colorability of mixed hypergraphs and their chromatic inversions. Journal of Combinatorial Optimization, 2012. Available online.

    81. Cs. Bujtas, Zs. Tuza. Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discrete Mathematics, 2012. Available online.

    82. Gábor Bacsó, Tamás Héger, Tamás Szonyi. The 2-blocking number and the upper chromatic number of PG(2, q). Available online.

    83. Zhao, Ping; Diao, Kefeng; Chang, Renying; Wang, Kaishun. The smallest one-realization of a given set II. Discrete Mathematics. Available online, July 7, 2012.

    84. Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen. On the Price of Equivocation in Byzantine Agreement. Microsoft Research, Microsoft Corporation 2012.

    85. Zhao, Ping; Diao, Kefeng; Wang, Kaishun. The smallest one-realization of a given set. The Electronic Journal of Combinatorics 19 (2012), #P19.

    86. Alberto Amato, Mario Gionfriddo, Lorenzo Milazzo. 2-Regular equicolourings for P4-designs. Discrete Mathematics, 2012.

      2011

    87. J. Matthews. Maximal induced colorable subhypergraphs of all uncolorable BSTS(15)s. Computer Science Journal of Moldova, vol.19, no. 1(55), 2011, pp. 29- 37.

    88. MR2856254 Zheng, Guo Biao. A necessary and sufficient condition for that D-complete uniform mixed hypergraphs are uncolorable. (Chinese) Pure Appl. Math. (Xi'an) 27 (2011), no. 3, 308–312. 05C15 (05C65)

    89. Gionfriddo, Mario(I-CATN-MI); Amato, Alberto(I-CATN-MI); Ragusa, Giorgio(I-CATN-MI) Equipartite edge colouring of multigraphs. (English summary) Util. Math. 86 (2011), 297–304.

    90. Bujtas, C., Tuza, Zs., Voloshin, V. COLOR-BOUNDED HYPERGRAPHS, V: HOST GRAPHS AND SUBDIVISIONS. Discussiones Mathematicae Graph Theory, 31(2), 223-238.

    91. MR2837623: Zhao, Ping (PRC-LYNU-SSC); Diao, Kefeng (PRC-LYNU-SSC); Wang, Kaishun (PRC-BJN-SMS) The chromatic spectrum of 3-uniform bi-hypergraphs. Discrete Math. 311 (2011), no. 23-24, 2650–2656. 05C15 (05C65)

      2010

    92. J. Matthews, B. Tolbert. All proper colorings of every colorable BSTS(15). Computer Science Journal of Moldova, vol.18, no. 1(52), 2010, pp. 41 - 53.

    93. Ping Zhao, Kefeng Diao. Upper Chromatic Number of Steiner Triple Systems. ARS COMBINATORIA 97 (2010), pp. 389-397.

    94. Gionfriddo, Lucia(I-CATN-MI); Gionfriddo, Mario(I-CATN-MI); Ragusa, Giorgio(I-CATN-MI) Equitable specialized block-colourings for 4-cycle systems—I. (English summary) Discrete Math. 310 (2010), no. 22, 3126–3131.

    95. Bujtas, C., Tuza, Zs.,Voloshin's conjecture for C-perfect hypertrees. AUSTRALASIAN JOURNAL OF COMBINATORICS, Volume 48 (2010), Pages 253-267

    96. Z. Dvorak, J. Kara, D. Kral, O. Pangrac. Pattern hypergraphs. The Electronic Journal of Combinatorics, 17 (2010) #R15.

    97. G. Bacso, Cs. Bujtas, Zs. Tuza, V. Voloshin. New challenges in the theory of hypergraph coloring. Proc. ICDM 2008, RMS-Lecture Notes Series No. 13, 2010, pp. 45-57.

    98. Bujtas, Csilla and Tuza, Zsolt. Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Discrete Math. 310 (2010), 1463--1474.

    99. Bujtas, Cs.; Sampathkumar, E.; Tuza, Zs.; Subramanya, M. S.; Dominic, Ch. Voloshin's conjecture for C-perfect hypertrees. Discussiones Mathematicae Graph Theory, 30 (2010), 393-405.

      2009

    100. V.Voloshin. Graph Coloring: History, results and open problems. Alabama Journal of Mathematics, Spring/Fall 2009.

    101. Bujtas, Csilla and Tuza, Zsolt. Coloring intervals with four types of constraints. In: 6th Japanese-Hungarian Symposium on on Discrete Mathematics and Its Applications. (A. Frank et al., Eds.), Budapest, Hungary, May 16-19, 2009, 393--401.

    102. Zs. Tuza, G. Bacso, Cs. Bujtas, V. Voloshin. Hypergraph coloring: new kinds of problems. In: Midsummer Combinatorial Workshop 2008 (J. Maxova, Ed.), KAM-DIMATIA Series Vol. 916 (2009), 92--94.

    103. Csilla Bujtas, Zsolt Tuza. C-perfect hypergraphs. Journal of Graph Theory. Volume 64 Issue 2, Pages 132 - 149. Published Online: 20 Oct 2009.

    104. V. Voloshin. Introduction to Graph and Hypergraph Theory. Textbook. Nova Science Publishers, 2009.

    105. Bujtas, Csilla and Tuza, Zsolt. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Discrete Math. 309 (2009), 6391--6401.

    106. Bujtas, Csilla and Tuza, Zsolt. Color-bounded hypergraphs, I: General results. Discrete Math. 309 (2009), no. 15, 4890--4902.

    107. L. Milazzo, Zs. Tuza. Logarithmic upper bound for the upper chromatic number of $S(t,t+1,v)$ systems. Ars Combin. 92 (2009), 213--223.

      2008

    108. T. Griggs, G. Lo Faro, G. Quattrocchi. On some colouring of 4-cycle systems with specified block colour patterns. Discrete Mathematics, Volume 308, Issues 2-3, 6 February 2008, Pages 465-478.

    109. G. Bacso, Zs. Tuza. Upper chromatic number of finite projective planes. J. Combin. Des. 16 (2008), no. 3, 221--230.

    110. Cs. Bujtas. Algorithms and structure: set partitions under local constraints. PhD Thesis. University of Pannonia, Veszprem, Hungary, 2008.

    111. V. Voloshin. Coloring theory: history, results and open problems. Combinatorics 2008, Costermano, (VR), Italy, 22-28 June, 2008, pp. 173 - 177.

    112. Zs. Tuza, V. Voloshin. Problems and results on colorings of mixed hypergraphs. Horizons of Combinatorics. (E. Gyori et al, eds.) Bolyai Society Mathematical Studies 17, Springer-Verlag, 2008, 235 - 255.

    113. G. Bacso, Cs. Bujtas, Zs. Tuza, V. Voloshin. New challenges in the theory of hypergraph coloring. Proc. Int. Conf. ICDM 2008, pp. 67--78.

    114. Cs. Bujtas, Zs. Tuza. Uniform Mixed Hypergraphs: The Possible Numbers of Colors. Graphs and Combinatorics, Volume 24 , Issue 1 (February 2008), Pages 1-12.

      2007

    115. L. Milazzo, Zs. Tuza. A class of Steiner Systems S(2,4,v) with arcs of extremal size. Tatra Mountains Mathematical Publications 36 (2007), 153--162.

    116. M. Gionfriddo, A. Amato. Colourings of Voloshin for $S\sb 2(2,3,v)$. Util. Math. 74 (2007), 19--32.

    117. A.D. Forbes, M.J. Grannell, T.S. Griggs. New type B colorable $S(2,4,v)$ designs. J. Combin. Des. 15 (2007), no. 4, 357--368.

    118. Gabor Bacso, Zsolt Tuza. Upper chromatic number of finite projective planes. Journal of Combinatorial Designs, Published Online: 4 Sep 2007.

    119. Ping Zhao, Kefeng Diao. On the Upper Chromatic Numbers of Mixed Interval Hypertrees. Lecture Notes in Computer Science, Springer Berlin / Heidelberg ISSN 0302-9743 (Print) 1611-3349 (Online), Volume 4381 (2007) 272-277.

    120. DIAO Ke-feng and ZHAO Ping. On the coloring of C-hypergraphs with minimum connected pair graphs. Chinese Journal of Organic Chemistry 2007- 42- 2:56-58.

    121. P. Johnson, V. Voloshin. Geombinatorial Mixed Hypergraph Coloring Problems. Geombinatorics, Vol XVII (2), 2007, 57-67.

    122. Cs. Bujtas, Zs. Tuza. Orderings of uniquely colorable hypergraphs. Discrete Applied Mathematics, 155 (2007) 1395-1407.

    123. Cs. Bujtas, Zs. Tuza. Color-bounded hypergraphs III: Model comparison. Applicable Analysis and Discrete Mathematics 1 (2007), 36-55.

    124. D. Kral. Mixed Hypergraphas and other coloring problems. Discrete Mathematics 307 (7-8) (2007), 923-938.

      2006

    125. J. Yu, K. Diao, G. Liu. The Minimum Edge Number of a 4-Uniform Co-Hypergraph. OPERATIONS RESEARCH TRANSACTIONS, 2006, Vol. 10, No. 1, p. 95-98 (in Chinese).

    126. K. Diao, G. Liu, D. Rautenbach, P. Zhao. A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discrete Math. 306 (2006), no. 7, 670--672.

    127. Cs. Bujtas, Zs. Tuza. Mixed colorings of hypergraphs. Electronic Notes in Discrete Mathematics, 24 (2006), 273-275.

    128. D. Kral, J. Kratochvil, A. Proskurowski, H.-J. Voss. Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006).

    129. V.Voloshin. Coloring Mixed Hypergraphs: from Combinatorics to Philosophy. In: LE MATEMATICHE Vol. LIX (2004)-Fasc. I-II, pp. 393-402. Palermo, 2006.

    130. V.Voloshin, H.-J. Voss. Circular mixed hypergraphs II:The upper chromatic number. Discrete Applied Mathematics, Volume 154, Issue 8 , 15 May 2006, Pages 1157-1172.

      2005

    131. V.Voloshin. Problem 2. C-hypergraph perfection. Discrete Applied Mathematics 154 (2006) 604 – 607.

    132. Amato, Alberto(I-CATN-MI), Colourings of Voloshin for $ATS(v)$. (English summary) Matematiche (Catania) 57 (2002), no. 2, 275--286 (2005).

    133. G. Lo Faro, A. Tripodi. Strict colourings of STS(3v)s and uncolourable BSTS(3v)s, Discrete Math. 1 (301) (2005) 117-123.

    134. K. Roblee, V. Voloshin. About the upper chromatic number of mixed hypertree. Computer Science Journal of Moldova, Vol.13, No.2 (38), 2005, pp.131-135.

    135. K. F. Diao, G. Liu. The Coloring Theory of Mixed Hypergraphs. ADVANCES IN MATHEMATICS 2005, Vol. 34, No. 2, P. 145-154.

    136. V. Voloshin. Coloring Block Designs as Mixed Hypergraphs: survey. Abstracts of papers presented to the American Mathematical Society. Volume 26, Number 1, Issues 139, 2005, p.15, abstract 1003-05-129, Atlanta, Georgia, January 5-8, 2005.

      2004

    137. K. Diao, J. Yu. A sufficient condition for a C-perfect C-hypergraph. JOURNAL OF SHANDONG UNIVERSITY (NATURAL SCIENCE), 2004, Vol. 39 No. 3 P. 6-9.

    138. K. Diao, G. Liu. Bounds on minimum C-edge number of 4-uniform C-hypergraphs. MATHEMATICA APPLICATA, Vol. 17, No. 4, 2004, p. 1-6.

    139. L. Gionfriddo. Construction of ${\rm BP}\sb 3$-designs with mononumerical spectrum. Util. Math. 65 (2004), 201--218.

    140. D. Kral. On feasible sets of mixed hypergraphs. Electron. J. Combin. 11 (2004), Research Paper 19, 14 pp.

    141. D. Kral, J. Kratochvil, H.-J. Voss. Mixed hypercacti. Discrete Math. 286 (2004), no. 1-2, 99--113.

    142. P. Adams, D. Bryant, J. Lefevre, M. Waterhouse. Some equitably 3-colourable cycle decompositions. Discrete Math. 284 (2004), no. 1-3, 21--35

    143. A. Rosa. Blocking sets and colourings in Steiner Systems S(2,4,v). Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.

    144. A. Amato, M. Gionfriddo. Bicolourings for S2(2,3,v). Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.

    145. H. Gropp. Colourings of configurations as mixed hypergraphs. Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.

    146. V. Voloshin. Coloring Mixed Hypergraphs: from Combinatorics to Philosophy. Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.

    147. M. Gionfriddo, G. Quattrocchi. Colouring 4-cycle systems with equitably coloured blocks, Discrete Mathematics, 284 (2004) 137-148.

    148. D. Kral. On maximum face-constrained coloring of plane graphs with no short face cycles. Discrete Math. 277 (2004), no. 1-3, 301--307.

    149. M. Gionfriddo, L. Milazzo, A. Rosa, V. Voloshin. Bicoloring Steiner systems S(2,4,v). Discrete Mathematics, 283 (2004) 249-253.

    150. G. Lo Faro, A. Tripodi. Triplication for BSTSs and uncolourability. Discrete Mathematics, 284 (2004) 197-203.

    151. J. Gross, J Yellen (Eds). Handbook of Graph Theory. CRC, 2004 (in section "Hypergraph Coloring").

    152. L. Gionfriddo. Voloshin's colourings of P3-designs. Discrete Mathematics, Volume 275, Issues 1-3 , 28 January 2004, Pages 137-149.

    153. Zhao, P., Diao, K. F. A problem on minimum number of edges and colorings for $\scr C$-hypergraphs. (Chinese) Qufu Shifan Daxue Xuebao Ziran Kexue Ban 30 (2004), no. 2, 33--36.

      2003

    154. P. Danziger, E. Mendelsohn. Bicolour graphs of Steiner triple systems. Discrete Math. 261 (2003), no. 1-3, 157--176.

    155. M. Gionfriddo. Colourings of hypergraphs and mixed hypergraphs. Rendiconti del Seminario Matematico di Messina. Serie II, Tomo XXV, Volume n.9 (2003), pages 87-98. Proceedings of the International Symposium on Graphs, Designs and Applications. Villa Pace, Messina, 30 September - 4 October, 2003.

    156. V. Voloshin. Coloring Mixed Hypegraphs: some results and open problems. Rendiconti del Seminario Matematico di Messina. Serie II, Tomo XXV, Volume n.9 (2003), pages 237-244. Proceedings of the International Symposium on Graphs, Designs and Applications. Villa Pace, Messina, 30 September - 4 October, 2003.

    157. D. Kral' Mixed Hypergraphs and Other Coloring Problems. ITI report 2003-160; postscript.zip (116K, 30p).

    158. C.J. Colbourn, A. Rosa. Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs and Combinatorics, Volume 19, Number 3, Pages 335 - 345.

    159. M. Greig, A. Rosa. Maximal arcs in Steiner systems S(2,4,v). Discrete Mathematics, 267 (2003) 143 - 151.

    160. Zs. Tuza, V. Voloshin. Linear-time algorithm for the edge-colorability. Comput. Sci. J. Moldova, V.11, N.1(31), 2003, pp. 35-42.

    161. D. Kral', J. Kratochvil, H.-J. Voss. Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theoretical Computer Science, Volume 295, Issues 1-3 , 24 February 2003, Pages 263-278.

    162. L. Milazzo, Zs. Tuza, V. Voloshin. Strict colorings of Steiner triple and quadruple systems: a survey. Discrete Mathematics, 261 (2003), 399-411.

    163. G. Bacso, Zs. Tuza, V. Voloshin. Unique colorings of bi-hypergraphs, Australas. J. Combin. 27 (2003) 33-45.

    164. D. Kral'. A counter-example to Voloshin's hypergraph co-perfectness conjecture. Australas. J. Combin. 27, (2003), p.25.

    165. L. Gionfriddo. Nesting of G-designs. Ph.D. Thesis, University of Catania, 2003 (in Italian).

    166. Diao, K. F., Liu, G. Z., Zhao P. Totally irregular embedding of co-hypergraphs. (Chinese) Gongcheng Shuxue Xuebao 20 (2003), no. 3, 111--116.

      2002

    167. V.I. Voloshin. Coloring Mixed Hypergraphs: theory, algorithms and applications. AMS, Providence, 2002.

    168. Z. Dvorak, J. Kara, D. Kral, O. Pangrac. Complexity of Pattern Coloring of Cycle Systems. In: L. Kucera (Ed.): WG 2002, LNCS 2573, pp. 164–175, 2002. Springer-Verlag Berlin Heidelberg 2002

    169. L. Gionfriddo. P(3)-designs with gaps in the chromatic spectrum. Rendiconti Seminario Matematico Universita Messina 8 (2002), 49-58.

    170. A. Kundgen, R. Ramamurthi. Coloring face-hypergraphs of graphs on surfaces. J. Combin. Theory Ser. B 85 (2002), no. 2, 307--337.

    171. S. Milici. Colouring Steiner triple systems. Rendiconti Seminario Matematico Universita Messina 8 (2002), 113-118.

    172. A. Tripodi. A survey on strict colourings for a class of STS(3v)s. Rendiconti Seminario Matematico Universita Messina 8 (2002), 207-214.

    173. V.I.Voloshin. Problem # 10976. The American Mathematical Monthly, Vol. 109, No. 9, 2002.

    174. L. Gionfriddo, V. Voloshin. The smallest bihypergraph with a gap in the chromatic spectrum has 7 vertices and 9 edges. Bulletin of the ICA, Volume 36 (2002), 73-79.

    175. C. Arbib, M. Flammini. On the upper chromatic number of (v3,b2)-configurations. Discrete Applied Mathematics, 120 (2002) 3-12.

    176. A. Tripodi. Due problematiche classiche nella teoria degli ipergrafi e dei disegni: colorazioni e "intersection problem". Ph.D. Thesis, University of Messina, 2002 (in Italian).

    177. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. West. The Chromatic Spectrum of Mixed Hypergraphs. Graphs and Combinatorics, 18 (2002) 309-318.

    178. Zs. Tuza, V. Voloshin, H. Zhou Uniquely colorable mixed hypegraphs. Discrete Mathematics, 248 (2002) 221-236.

    179. V.I. Voloshin, H.-J. Voss. Circular Mixed Hypergraphs II: The Upper Chromatic Number. Preprint TU Dresden, MATH-AL-2-2002, 1-26. Abstract on www.math.tu-dresden.de

    180. M. Gionfriddo, L. Milazzo, V. Voloshin. On the upper chromatic index of a multigraph. Comput. Sci. J. Moldova, V.10, N.1(28), 2002, pp.81-91.

    181. D. Lozovanu, V. Voloshin, A. Zelikovsky. A note on the colorability of a mixed hypergraph using k colors. Comput. Sci. J. Moldova, , V.10, N.1(28), 2002, pp.92-95.

    182. Kral D.: A Counter-Example to Voloshin's Hypergraph Co-perfectness Conjecture, preprint, KAM-DIMATIA Series 2002-547.

    183. Kral D.: On Maximum Face-Constrained Coloring of Plane Graphs of Girth at least 5, preprint, KAM-DIMATIA Series 2002-545.

    184. Dvorak Z., Kara J., Kral. D., Pangrac O.: On Pattern Coloring of Cycle Systems, preprint, KAM-DIMATIA Series 2002-548.

    185. Diao, Ke Feng; Zheng, Qing Yu. The upper chromatic number of the Cartesian product of co-hypergraphs. (Chinese. English, Chinese summary) Math. Appl. (Wuhan) 15 (2002), suppl., 5--8.

      2001

    186. A. Niculitsa, V.Voloshin, H.-J. Voss. Circular and uniquely colorable mixed hypergraphs. Electronic Notes in Discrete Mathematics Volume 8, May 2001, Pages 115-118.

    187. J. Kratochvil. Gap-freeness of feasible sets of mixed hypergraphs. In J. Kara, D. Kral (Eds.), Graph Theory Day IV. KAM-DIMATIA series 2001-522, Prague, 2001, p. 11.

    188. M. Gionfriddo, L. Milazzo, V. Voloshin. On the upper chromatic index of a multigraph. Preprint of Catania University, (2001) (ps,282k).

    189. S. Milici, A. Rosa, V. Voloshin. Colouring Steiner systems with specified block colour pattern. Discrete Math., 240 (2001) 145-160.

    190. Dvorak Z., Kral. D.: On Planar Mixed Hypergraphs, Electronic Journal on Combinatorics, vol. 8 (1), #R35, 2001.

    191. G. Quattrocchi. Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P3-designs. Electron. J. Combin. 8(1) (2001) R24.

    192. L. Gionfriddo. Extremal gaps in BP_3 designs. Comput. Sci. J. Moldova 9 (3) (2001), 305--320.

    193. Kral D.: On Complexity of Colouring Mixed Hypertrees, Proceedings 13th International Symposium, Fundamentals of Computation Theory, 1st Workshop on Efficient Algorithms, Lecture Notes in Computer Science vol. 2138, p. 516-524, Springer-Verlag, 2001

    194. Kral D., Kratochvil J., Voss H.-J.: Complexity Note on Mixed Hypergraphs, Proceedings 26th International Symposium, Mathematical Foundations of Computer Science 2001, Lecture Notes in Computer Science vol. 2136, p. 474-486, Springer-Verlag, 2001.

    195. Kral D., Kratochvil J., Voss H.-J.: Complexity Note on Mixed Hypergraphs, preprint, MATH-AL 6-2001, TU Dresden.

    196. Kral D., Kratochvil J., Voss H.-J.: Complexity Note on Mixed Hypergraphs, preprint, ITI report 2001-023.

    197. D. Kral, J. Kratochvil, H.-J. Voss: Mixed Hypergraphs with Bounded Degree: Edge--Coloring of Mixed Multigraphs, to appear in the special volume of Theoretical Computer Science from MFCS 2001.

    198. Kral D., Kratochvil J., Voss H.-J.: Mixed Hypercacti, preprint, KAM-DIMATIA Series 2001-535.

    199. Kral D., Kratochvil J., Voss H.-J.: Mixed Hypercacti, preprint, ITI report 2001-032.

    200. Kral D.: On Feasible Sets of Mixed Hypergraphs, preprint, KAM-DIMATIA Series 2001-540.

    201. M. Buratti, M. Gionfriddo, L. Milazzo, V. Voloshin. Lower and upper chromatic numbers for BSTSs(2^h - 1). Comput. Sci. J. Moldova, Vol. 9, No 2, (2001), 259-272.

    202. V.I. Voloshin. Coloring Mixed Hypergraphs: theory, algorithms and applications. In: Mathematical Society of the Republic of Moldova - UNESCO. First Conference of the Mathematical Society of the Republic of Moldova. Abstracts. Chisinau (2001), p.155.

    203. V. Prisacaru. The coloring properties of conformal acyclic mixed hypergraphs. In: Mathematical Society of the Republic of Moldova - UNESCO. First Conference of the Mathematical Society of the Republic of Moldova. Abstracts. Chisinau (2001), p. 123-124.

    204. V.I. Voloshin. Greedy algorithms for the lower and upper chromatic numbers, in: Combinatorics, Computability and Logic, (C.S. Calude, M.J. Dinneen, S. Sburlan, eds.), Proceedings of DMTCS'01, Springer-Verlag, London (2001), 241-251.

    205. D. Kobler, A. Kundgen. Gaps in the chromatic spectrum of face-constrained plane graphs. Electron. J. Combin. 8 (1) (2001) N3.

    206. G. Lo Faro, L. Milazzo, A. Tripodi. On the Upper and Lower Chromatic Numbers of BSQSs(16). Electron. J. Combin. 8(1) (2001) R6.

    207. M. Gionfriddo, L.Milazzo, V.Voloshin. On the upper chromatic index of a graph. DCCG Workshop, Lethbridge, July 9-14, 2001. Abstracts. Page 11.

      2000

    208. Zs. Tuza. Extremal bi-Helly families. Discrete Math. 213 (2000) 321--331.

    209. G. Lo Faro, L. Milazzo, A. Tripodi. The first BSTS with different upper and lower chromatic numbers. Australas. J. Combin. 22 (2000), 123--133.

    210. E.M. Li Marzi. Strict colorings for classes of 4-cycle systems. III International Conference in "Stochastic Geometry, Convex Bodies and Empirical Measures", Part I (Mazara del Vallo, 1999). Rend. Circ. Mat. Palermo (2) Suppl. No. 65, part I (2000), 201--218 (in Italian) .

    211. K. Diao, P. Zhao, H. Zhou. About the upper chromatic number of a co-hypergraph. Discrete Math. 220 (1-3) (2000), 67--73.

    212. A. Niculitsa, H.-J. Voss. A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2. Australas. J. Combin. 21 (2000), 167--177.

    213. E.M. Li Marzi, M.C. Marino. On planar mixed hypergraphs. Comput. Sci. J. Moldova 8 (3) (2000), 247--259.

    214. A. Niculitsa. Structure of some classes of uc mixed hypergraphs. Ph.D. Thesis, Moldova State University, Chisinau (2000) (in Romanian).

    215. V. Prisakaru. Methods of investigation of chromatic properties of hypergraphs. Ph.D. Thesis, Moldova State University, Chisinau (2000) (in Romanian).

    216. A. Kundgen, E. Mendelsohn, V. Voloshin. Colouring of planar mixed hypergraphs. Electron. J. Combin. 7 (2000), R60.

    217. Zs. Tuza, V. Voloshin. Uncolorable mixed hypergraphs. Discrete Applied Mathematics, 99 (2000) 209-227.

    218. Kral D., Kratochvil J., Proskurowski A., Voss H.-J.: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science vol. 1928, p. 279-289, Springer-Verlag, 2000.

    219. Kral D., Kratochvil J., Proskurowski A., Voss H.-J.: Coloring mixed hypertrees, preprint, MATH-AL 8-2000, TU Dresden.

    220. Kral D., Kratochvil J., Proskurowski A., Voss H.-J.: Coloring mixed hypertrees, preprint, ITI report 2000-003.

    221. A. Niculita. Caracterizarea structurii unor clase de hipergrafe mixte unic colorabile. Institutul de cercetari stiintifice in domeniul informatiei tehnico-stiintifice; Certificat de depunere a manuscrisului Nr. 1773-M2000, 10 p.

    222. A. Niculitsa. Some clases of mixed hypergraphs uniquely colorable with two colors. Scientific Annals, Faculty of Mathematics and Informatics, State University of Moldova, 2000, Vol.II, Nr. 1, p. 3-9.

    223. A. Niculitsa and V. Voloshin. About uniquely colorable mixed hypertrees. Discussione Mathematicae: Graph Theory. Vol. 20, No. 1, 2000, pp. 81-91.

    224. D. Lozovanu, V. Voloshin. Integer programming models for colorings of mixed hypergraphs. Computer Science Journal of Moldova, Vol.8, No 1 (22), 2000, p. 64--74.

    225. V. Prisacaru. About the mixed hypergraph coloring. Preceedings of the Tiberiu Popoviciu Itinerant Seminar of Functional Equations, Approximation and Convexity, pp. 193-196, Editura SRIMA, Cluj-Napoca, 2000.

    226. V. Prisacaru. The upper cromatic number of a co-hypergraph. Conferinta corpului didactico- -stiintific a USM pe anii 1998-99, pp.75-76, Chishinau, 2000.

    227. V.I. Voloshin, H.-J. Voss. Circular Mixed hypergraphs I: colorability and unique colorability. Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2000). Congr. Numer. 144 (2000), 207--219.

    228. V. Voloshin, H.-J. Voss. Circular Mixed hypergraphs I : colorability and unique colorability. Preprint Inst. of Algebra MATH-AL-3-2000, Technische Universitat Dresden, 2000.

    229. V. Voloshin and H.-J. Voss The upper chromatic number of circular mixed hypergraphs. KAM Series, Discrete Mathematics-Combinatorics, Operations Research-Optimization (Seventh Prague Combinatorial Workshop) 495 (2000), 26 - 28.

    230. T. Jiang. Structural and extremal problems in graph theory. Ph.D. Thesis. University of Illinois, Urbana, 2000.

    231. Diao, Ke Feng; Zhang, Chun Guo; Zheng, Qing Yu. The upper chromatic numbers of a class of Steiner triple systems. (Chinese) Qufu Shifan Daxue Xuebao Ziran Kexue Ban 26 (2000), no. 1, 21--23.

      1999

    232. C.Arbib. A primal-dual property of the upper chromatic number of mixed hypergraphs. Electronic Notes in Discrete Mathematics, Volume 3 (1999).

    233. J. Kratochvil, Zs. Tuza, M. Voigt. New trends in the theory of graph coloring: choosability and list coloring. DIMACS Series to Discrete Mathematics and Theoretical Computer Science. Volume 49, 1999, p.183-197, (sect. 8.4. Mixed hypergraphs: list colorings without lists).

    234. Ch. Colbourn, J. Dinitz and A. Rosa. Bicoloring Steiner Triple Systems. Electron. J. Combin. 6 (1999), R25.

    235. Ch.J. Colbourn, A. Rosa. Triple Systems. Clarendon Press, Oxford, 1999 (section 18.6. Strict colorings and the upper chromatic number, p. 340-341).

    236. M.C. Marino. Colorings of maximal planar bi-hypergraphs. Rendiconti del Seminario Matematico di Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10 November, 1999, p. 91-106.

    237. L. Milazzo. Colorazioni strette per sistemi di Steiner di tipo STS e SQS. Rendiconti del Seminario Matematico di Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10 November, 1999, p. 107-118.

    238. V. Prisakaru. The upper chromatic number of a co-hypergraph. Rendiconti del Seminario Matematico di Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10 November, 1999, p. 129-148.

    239. R. Scapellato, V. Voloshin. Some results on coloring of mixed hypergraphs. Rendiconti del Seminario Matematico di Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10 November, 1999, p. 149- 166.

    240. A. Tripodi. New results about strict colorings for small BSTSs and BSQSs. Rendiconti del Seminario Matematico di Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10 November, 1999, p. 181-190.

    241. V. Voloshin and H. Zhou. Pseudo-chordal mixed hypergraphs. Discrete Math., 202 (1999) 239-248.

    242. V. Voloshin. Upper chromatic number and C-perfect mixed hypergraphs. Paul Erdos and his Mathematics. Research Communications of the conference held in the memory of Paul Erdos, Budapest, Hungary, July 4-11, 1999, p. 267-269.

    243. A. Niculitsa and V. Voloshin. About uniquely colorable mixed hypertrees. Preprint MATH-AL-7-1999, Technische Universitat Dresden, 1999.

    244. A. Niculitsa, V. Voloshin, H.-J. Voss. Uniquely colorable and circular mixed hypergraphs. 6th Twente Workshop on Graphs and Combinatorial Optimization, 26-28 May, 1999, H.J. Broersma, U.Faigle and J.L. Hurink (eds.). University of Twente, May, 1999, 173-176. Electronic Notes in Discrete Mathematics, Vol. 8 (2001).

    245. A. Niculitsa, V. Voloshin, H.-J.Voss. Circular and uniquely colorable mixed hypergarphs. Scientific Annals, Faculty of Mathematics and Informatics, State University of Moldova, 1999, p. 131-136.

    246. A. Niculitsa, H.-J. Voss. About uniquely colorable mixed hypergraphs. Congressus Numerantium 136 (1999), p. 33 - 42.

    247. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D.B. West, Chromatic spectrum is broken. 6th Twente Workshop on Graphs and Combinatorial Optimization, 26-28 May, 1999, H.J. Broersma, U.Faigle and J.L. Hurink (eds.). University of Twente, May, 1999, 231--234. Electronic Notes in Discrete Mathematics, Vol. 3 (1999).

      1998

    248. L. Milazzo, Zs. Tuza. Strict Colourings for Classes of Steiner Triple Systems. Discrete Math., 182 (1998) 233-243.

    249. A. Naso. Grafi - ipergrafi - sistemi di m-cicli e colorazioni. Tesi di Laurea (M.S. Thesis). University of Messina, 1998.

    250. A. Niculita. Caracterizarea structurii unor clase de hipergrafe mixte. Conferinta corpului didactico-stiintific "Bilantul activitatii stiintifice a USM pe anii 1996-1997", 30 sept.- 5 oct. 1998, Rezumatele comunicarilor, Stiinte naturale, Chisinau USM, 1998, p. 53.

    251. S. Lizzio. Greedy algorithm for the upper chromatic number. Tesi di Laurea (M.S. Thesis). Catania University, 1998.

    252. V. Prisakaru. About the coloring of an arbitrary co-hypergraph. Conferinta corpului didactico-stiintific a USM pe anii 1996-97, p.46, Chishinau, 1998.

    253. V. Voloshin. Colorings of Mixed Hypergraphs. Abstract 60. Twenty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing. March 9-13, 1998. Program and Abstracts.

    254. E. Flocos. Elaboration of methods and algorithms for coloring of some special classes of mixed hypergraphs. Ph.D. Thesis, Moldova State University (1998) (in Romanian).

      1997

    255. V. Prisakaru. The upper chromatic number of quasi-interval co-hypergraphs, Le Mathematiche, Vol. LII (1997) - Fasc.II, pp. 237-260.

    256. V. Prisakaru. Coloring quasi-interval co-hypergraphs. Anale stiintifice ale USM, Stiinte reale. Chisinau, 1997, p. 52-58.

    257. V. Prisakaru. The upper chromatic number and the chromatic classes of a hypergraph. Abstract at the confernce ''Optimal Discrete Structures and Algorithms. (ODSA-97), Rostock, 1997.

    258. E. Bulgaru, V.I. Voloshin. Mixed Interval Hypergraphs, Discrete Applied Mathematics, 77 (1997) 29-41.

    259. Zs. Tuza, V. Voloshin. Uncolorable Mixed Hypergraphs. 5th Twente Workshop on Graphs and Combinatorial Optimization, 18-20 May, 1997, U.Faigle and C.Hoede (eds.). University of Twente, May, 1997, 231-234.

    260. E. Flocos. Proprietati cromatice ale co-monostelelor. Buletinul Academiei de Stiinte a RM, Matematica. Chisinau, 1997, No 3, p.8-19.

    261. E. Flocos. The upper chromatic number of simple co-monostars. Anale stiintifice ale USM, Stiinte reale. Chisinau, 1997, p.22-27.

    262. L.Milazzo. The monochromatic block number, Discrete Mathematics, 165 - 166 (1997), 487--496.

    263. L. Milazzo, Zs. Tuza, Upper Chromatic Number of Steiner Triple and Quadruple Systems. Discrete Math., 174 (1997), 247-259.

    264. V. Miagkov. The r-uniform chordal conformal co-perfect hypergraphs. M.S. Thesis, Moldova State University (1997), (in Russian).

    265. I. Murovannaia. About some properties of mixed hypergraph coloring. M.S. Thesis, Moldova State University, (1997) (in Russian).

      1996

    266. L. Milazzo. Sul numero cromatico superiore nei sistemi di Steiner., Ph.D. Thesis, University of Catania, (1996).

    267. V. Prisakaru. The coloring algorithm for quasi-interval co-hypergraphs. Conferinta stiintifica jubiliara 2-3 octombrie 1996, p.12-14, Chisinau, 1996.

    268. V. Prisakaru. Upper chromatic number of a quasi-interval co-hypergraph. Seminarul itinerant ''Tiberiu Popoviciu'', p.143-145, Cluj-Napoca, 1996.

    269. V. Voloshin. Three questions to biologists. International Colloquium on Combinatorics and Graph Theory. July 15-20, 1996. Abstracts. Balatonlelle, Hungary, p.39.

    270. V. Voloshin. About colorings, greedy strategy and maximal life time. l Seminarul itinerant "Tiberiu Popoviciu" de ecuatii functionale, aproximare si convexitate. Cluj-Napoca, 21-25 Mai, 1996, p.161-164.

    271. E. Flocos. Proprietati ale co-monostelelor. Abstract, International Conference on mathematics and Informatics. Chisinau, 1996, September 19-21, p.70-71.

    272. M.F. Mammana. On the upper edge-colorings for Steiner Systems. Journal of Combinatorics, Information and System Sciences. Vol.21, No.1, 81-86 (1996).

    273. M.C. Marino. Free Colorings of Distance s of a co-hypergraph. Journal of Combinatorics, Information and System Sciences. Vol.21,No.1,61-69 (1996).

    274. D. Malai. Coloring of co-hypertrees. M.S. Thesis. Moldova State University, 1996.

    275. V. Suman. Upper chromatic number of a co-hypergraph. M.S. Thesis. Moldova State University, 1996.

      1995

    276. V. Prisakaru. The coloring algorithm for the clique co-hypergraph of an interval graph. Seminarul itinerant ''Tiberiu Popoviciu'', Cluj-Napoca, 1995.

    277. V. Voloshin. Hypergraph Drawing and Optimization System. Atti Academia Peloritana dei Pericolanti Classe I di Scienze Fis. Mat. e Nat., Vol.LXXIII (1995), p.1-3.

    278. V.I. Voloshin. The bases of New Coloring Theory. 5eme Colloque International Graphes et Combinatoire, Marseille, Luminy, 3-8 September, 1995, p. 86.

    279. V.I. Voloshin. New Approach in Coloring Theory. 4th Twente Workshop on Graphs and Combinatorial Optimization, 7-9 June, 1995, U.Faigle and C.Hoede (eds.). University of Twente, May, 1995, 231-234.

    280. V.I. Voloshin. On the upper chromatic number of a hypergraph. Australasian Journal of Combinatorics, No.11, March, 1995, 25-45.

    281. V.I. Voloshin. Numarul chromatic superior al hipergrafurilor intervale mixte. Materialele conferintei corpului didactico-stiintific - bilantul activitatii stiintifice a U.S.M. pe anii 1993-1994, 20-27 martie 1995, Stiintele naturale. Chisinau - USM - 1995, p. 56.

    282. E. Flocos. Unele proprietati ale hipergrafelor intervale mixte. Bilantul activitatii stiintifice a USM pe anii 1993-1994. Chisinau, USM, 1995, p.56.

    283. L. Milazzo. On upper chromatic number for SQS(10) and SQS(16). Le Matematiche, Vol. L (1995) - Fasc. I, pp. 179-193, Catania.

      1994

    284. V.I. Voloshin. On the upper chromatic number of a hypergraph. Conference on Discrete and Computational Geometry, Mathematical Institute of the Hungarian Academy of Sciences, Budapest, May 30- June 3, 1994, p.19-20.

    285. V.I. Voloshin. On the upper chromatic number of a hypergraph and related problems. An International Conference on Incidence Geometries and Combinatorial Structures COMBINATORICS'94, Roma, Montesilvano (PE), 10-16 September, 1994, p.91.

    286. E. Bulgaru, V.I. Voloshin. Mixed Interval Hypergraphs. Technical Report Gerhard-Mercator-Universitat - Gesamthochschule Duisburg SM-DU-259, 1994.

    287. V.I. Voloshin. A maximal lifetime of systems and co-perfect hypergraphs. Advances in Modelling and Analysis, A, AMSE Press, Vol.20, No 4, 1994, p.1-18.

    288. E. Bulgaru. Mixed interval hypergraphs. M.S. Thesis, Moldova State University, Kishinev, 1994.

      1993

    289. V.I. Voloshin. The mixed hypergraphs. Computer Science Journal of Moldova, Vol.1, No 1(1), 45-52, 1993.

      1992

    290. V.I. Voloshin. On the upper chromatic number of a hypergraph. Scientific research conference of Moldova State University. Theses of Reports, Kishinev, 1992, V.1, p.42.

    291. V.I. Voloshin. On the upper chromatic number of a hypergraph. Preprint of Moldova State University (1992).