193 publications by OTHER mathematicians containing references to my publications (citation index):

Last Updated November 19, 2009 by Vitaly Voloshin

    2009

  1. Brešar, Boštjan; Šumenjak, Tadeja Kraner Cube intersection concepts in median graphs. Discrete Math. 309 (2009), no. 10, 2990--2997.

  2. Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M.H.; Gutierrez, Marisa. The complexity of clique graph recognition. Theoret. Comput. Sci. 410 (2009), no. 21-23, 2072--2083.

  3. Bujtás, Csilla and Tuza, Zsolt. Color-bounded hypergraphs. I. General results. Discrete Math. 309 (2009), no. 15, 4890--4902.

  4. 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

  5. Dourado, Mitre C.; Protti, Fábio; Szwarcfiter, Jayme L. On the strong $p$-Helly property. Discrete Appl. Math. 156 (2008), no. 7, 1053--1057.

  6. Griggs, Terry; Lo Faro, Giovanni; Quattrocchi, Gaetano. On some colouring of 4-cycle systems with specified block colour patterns. Discrete Math. 308 (2008), no. 2-3, 465--478.

  7. Ishizeki, Tetsuya; Otachi, Yota; Yamazaki, Koichi. An improved algorithm for the longest induced path problem on $k$-chordal graphs. Discrete Appl. Math. 156 (2008), no. 15, 3057--3059.

  8. Lee, Chuan-Min; Chang, Maw-Shang. Variations of $Y$-dominating functions on graphs. Discrete Math. 308 (2008), no. 18, 4185--4204.

  9. Montellano-Ballesteros, Juan José; Neumann-Lara, Víctor; Rivera-Campo, Eduardo On a heterochromatic number for hypercubes. Discrete Math. 308 (2008), no. 16, 3441--3448.

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

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

  12. Makowsky, J. A. From a zoo to a zoology: towards a general theory of graph polynomials. Theory Comput. Syst. 43 (2008), no. 3-4, 542--562.

    2007

  13. Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei. Tree spanners for bipartite graphs and probe interval graphs. Algorithmica 47 (2007), no. 1, 27--51.

  14. Dourado, Mitre C.; Protti, Fábio; Szwarcfiter, Jayme L. Characterization and recognition of generalized clique-Helly graphs. Discrete Appl. Math. 155 (2007), no. 18, 2435--2443.

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

  16. 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.

  17. J. A. Makowsky. From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. Theory of Computing Systems, 2007, online.

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

  19. 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.

  20. 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.

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

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

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

  24. Barth, Dominique; Cohen, Johanne; Faik, Taoufik. On the b-continuity property of graphs. Discrete Appl. Math. 155 (2007), no. 13, 1761--1768.

    2006

  25. Durán, Guillermo; Lin, Min Chih; Mera, Sergio; Szwarcfiter, Jayme Luiz. Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discrete Appl. Math. 154 (2006), no. 13, 1783--1790.

  26. Dourado, M. C., Protti, F., Szwarcfiter, J. L. Complexity aspects of the Helly property. Journal of the Brazilian Computer Society 12 (2006), pp. 7-33.

  27. Bonomo, Flavia; Durán, Guillermo; Groshaus, Marina; Szwarcfiter, Jayme L. On clique-perfect and $K$-perfect graphs. Ars Combin. 80 (2006), 97--112.

  28. Cho, Han Hyuk; Kim, Suh-Ryung; Lee, Jung Yeun. On the graph inequality $\theta\sb E(G)\geq\theta\sb E(G\sp m)$. Discrete Math. 306 (2006), no. 8-9, 738--744.

  29. Jungic, V., Kral, D., Skrekovski, R., Colorings of plane graphs with no rainbow faces. (English summary) Combinatorica 26 (2006), no. 2, 169--182.

  30. Bretto, Alain. Hypergraphs and the Helly property. Ars Combin. 78 (2006), 23--32.

  31. Dourado, Mitre C.(BR-FRJ-E); Protti, Fabio(BR-FRJ-IM); Szwarcfiter, Jayme L.(BR-FRJ-IM) Complexity aspects of generalized Helly hypergraphs. (English summary) Inform. Process. Lett. 99 (2006), no. 1, 13--18.

  32. 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).

  33. 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.

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

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

    2005

  36. Chepoi, Victor D.; Dragan, Feodor F.; Yan, Chenyu. Additive sparse spanners for graphs with bounded length of largest induced cycle. Theoret. Comput. Sci. 347 (2005), no. 1-2, 54--75.

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

  38. Z. Dvorak, D. Kral, R. Skrekovski. Coloring face hypergraphs on surfaces. European J. Combin. 26 (2005), no. 1, 95--110.

  39. Brucker, François. From hypertrees to arboreal quasi-ultrametrics. Discrete Appl. Math. 147 (2005), no. 1, 3--26.

  40. V. Chepoi, F. Dragan, C. Yan. Additive sparse spanners for graphs with bounded length of largest induced cycle. Theoret. Comput. Sci. 347 (2005), no. 1-2, 54--75.

  41. F. Brucker. From hypertrees to arboreal quasi-ultrametrics. Discrete Appl. Math. 147 (2005), no. 1, 3--26.

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

  43. J. Allagan. A generalization of the chromatic polynomial of a cycle. Computer Sci. J. of Moldova, Vol. 13, No 1 (37), 2005, Pages 9-12.

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

    2004

  45. Larrión, F.; de Mello, C. P.; Morgana, A.; Neumann-Lara, V.; Pizaña, M. A. The clique operator on cographs and serial graphs. Discrete Math. 282 (2004), no. 1-3, 183--191.

  46. Lau, Lap Chi; Corneil, Derek G. Recognizing powers of proper interval, split, and chordal graphs. SIAM J. Discrete Math. 18 (2004), no. 1, 83--102

  47. Quattrocchi, Gaetano; Tuza, Zsolt. Partition of $C\sb 4$-designs into minimum and maximum number of $P\sb 3$-designs. Graphs Combin. 20 (2004), no. 4, 531--540.

  48. G. Chartrand, L. Lesniak. Graphs and Digraphs. Chapman & Hall/CRC, Fourth edition. 2004.

  49. D. Mubayi, D. West. On restricted edge-colorings of bicliques. Discrete Math. V. 257 , Issue 2-3 (November 2004), Pages: 513 - 529.

  50. L. C. Lau, D. G. Corneil. Recognizing powers of proper interval, split, and chordal graphs. SIAM J. Discrete Math. 18 (2004), no. 1, 83--102.

  51. 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.

  52. 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.

  53. A. Bretto. Introduction to Hypergraph Theory and Its Use in Engineering and Image Processing. Advances in Imaging and Electron Physics, Vol. 131, p. 1-64, 2004, Elsevier Inc.

  54. M. Meszka, A. Rosa. Embedding Steiner triple systems into Steiner systems $S(2,4,v)$. Discrete Math. 274 (2004), no. 1-3, 199--212.

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

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

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

  58. F. Larrion, C.P. de Mello, A. Morgana, V. Neumann-Lara, M.A. Pizana. The clique operator on cographs and serial graphs. Discrete Math. 282 (2004), no. 1-3, 183--191.

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

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

  61. 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.

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

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

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

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

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

  67. L. Gionfriddo. Voloshin's colourings of P3-designs. Discrete Mathematics, 275 (2004) 137-149.

  68. A. Brandstadt, F. Dragan, H.-O. Le, V. B. Le. Tree spanners on chordal graphs: complexity and algorithms. Theoretical Computer Science, Volume 310, Issues 1-3 , 1 January 2004, Pages 329-354.

  69. 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.

  70. M. Dourado, F. Protti, J. Szwarcfiter. Characterization and recognition of generalized clique-Helly graphs. Proc. WG'2004. Lecture Notes in Computer Science 3353 (2004) 344-354.

    2003

  71. McKee, Terry A. Subgraph trees in graph theory. Discrete Math. 270 (2003), no. 1-3, 3--12.

  72. Brešar, Boštjan. Intersection graphs of maximal hypercubes. European J. Combin. 24 (2003), no. 2, 195--209.

  73. McKee, Terry A. Dualizing chordal graphs. Discrete Math. 263 (2003), no. 1-3, 207--219.

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

  75. 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.

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

  77. 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.

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

  79. T. McKee. Subgraph trees in graph theory. Discrete Mathematics, Volume 270, Issues 1-3 , 28 August 2003, Pages 3-12.

  80. 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.

  81. C. T. Hoang, S. Hougardy, F. Maffray, N. V. R. Mahadev. On simplicial and co-simplicial vertices in graphs. To appear in Discrete Applied Mathematics.

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

  83. B. Bresar. Intersection graphs of maximal hypercubes. European Journal of Combinatorics, Volume 24, Issue 2 , February 2003, Pages 195-209.

  84. J. Spinrad. Efficient graph representations. Fields Institute Monographs, 19. American Mathematical Society, Providence, RI, 2003.

  85. T. McKee. Dualizing chordal graphs. Discrete Math. 263 (2003), no. 1-3, 207--219.

  86. 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

  87. Kang, Ilwon; Kim, Suh-Ryung; Shin, Yangmi; Nam, Yunsun. Graphs satisfying inequality $\theta(G\sp 2)\leq\theta(G)$. Discrete Math. 250 (2002), no. 1-3, 259--264.

  88. F. M. Dong , K. L. Teo , K. M. Koh , M. D. Hendy. Non-chordal graphs having integral-root chromatic polynomials II. Discrete Mathematics, v.245 n.1, p.247-253, 28 February 2002.

  89. Mubayi, Dhruv; West, Douglas B. On restricted edge-colorings of bicliques. Kleitman and combinatorics: a celebration (Cambridge, MA, 1999). Discrete Math. 257 (2002), no. 2-3, 513--529.

  90. 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

  91. F.Franek, T.Griggs, C. Lindner, A. Rosa. Completing the spectrum of 2-chromatic S(2,4,v). Discrete Mathematics, 247 (2002), 225-228.

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

  93. A. Brandstadt, F. Dragan, H.-O. Le, V. B. Le. Tree spanners on chordal graphs: complexity and algorithms. Proceedings of The 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), November 20–23, 2002, Vancouver, Canada, Springer, Lecture Notes in Computer Science 2518, pp. 163–174.

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

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

  96. B.Troncarelli. Complessita e diritto. Monograph, University of Catania, 2002, 214 pp.

  97. C. T. Hoang. Perfectly orderable graphs: A survey. In: Perfect Graphs. Ramirez Alfonsin and Reed (eds). Wiley 2001, pp. 139-163.

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

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

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

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

  102. 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.

  103. A. Bretto, S. Ubeda, J. Zerovnik. A polynomial algorithm for the strong Helly property. Information Processing Letters, Volume 81, Issue 1 , 16 January 2002, Pages 55-57.

  104. I. Kang S.-R. Kim, Y. Shin, Y. Nam. Graphs satisfying inequality \theta(G^2)<=\theta (G). Discrete Mathematics, Vol. 250 (1-3) (2002) pp. 259-264.

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

    2001

  106. D.B. West. Introduction to Graph Theory. Prentice Hall (2001).

  107. 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.

  108. A. Gupta. Improved Bandwidth Approximation for Trees and Chordal Graphs. Journal of Algorithms, Volume 40, Issue 1 , July 2001, Pages 24-36.

  109. Dvorak Z., Kral. D.: On Planar Mixed Hypergraphs, Electron. J. Combin. 8 (1) (2001) R35.

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

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

  112. 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

  113. 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.

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

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

  116. 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.

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

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

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

  120. 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.

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

  122. M. Gutierrez. Intersection graphs and the clique operator. Graphs Combin. 17 (2001), no. 2, 237--244.

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

    2000

  124. Ho, Ting-Yem; Chang, Jou-Ming; Wang, Yue-Li. On the powers of graphs with bounded asteroidal number. Discrete Math. 223 (2000), no. 1-3, 125--133.

  125. McKee, Terry A. Strong clique trees, neighborhood trees, and strongly chordal graphs. J. Graph Theory 33 (2000), no. 3, 151--160.

  126. Protti, Fábio; Szwarcfiter, Jayme L. Clique-inverse graphs of $K\sb 3$-free and $K\sb 4$-free graphs. J. Graph Theory 35 (2000), no. 4, 257--272.

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

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

  129. 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) .

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

  131. 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.

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

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

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

  135. 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.

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

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

  138. 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.

  139. 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.

  140. 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.

  141. T. McKee. Strong clique trees, neighborhood trees, and strongly chordal graphs. J. Graph Theory 33 (2000), no. 3, 151--160.

  142. 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.

  143. 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

  144. T. McKee, F. Morris. Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphoia, 1999.

  145. A. Brandstadt, V.B. Le, J.P. Spinrad. Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia (1999).

  146. C. de Figueiredo, J. Meidanis, C. Picinin de Mello. Total-chromatic number and chromatic index of dually chordal graphs. Information Processing Letters, Volume 70, Issue 3 , 14 May 1999, Pages 147-152.

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

  148. A. Brandstadt, V. Chepoi, F. Dragan. Distance Approximating Trees for Chordal and Dually Chordal Graphs. Journal of Algorithms, Volume 30, Issue 1 , January 1999, Pages 166-184.

  149. 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).

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

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

  152. 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.

  153. 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.

  154. 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.

  155. 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.

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

    1998

  157. A. Brandstadt, V. Chepoi, F. Dragan. The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82 (1998), no. 1-3, 43--77.

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

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

  160. 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.

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

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

  163. 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

  164. A. Brandstadt, V. Chepoi, F. Dragan. Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM Journal on Discrete Mathematics, Volume 10, Number 1, pp. 109-127, 1997.

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

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

  167. 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.

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

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

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

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

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

  173. A. Brandstadt, F. Dragan, F. Nicolai. Homogeneously orderable graphs. Theoretical Computer Science, Volume 172, Issues 1-2 , 10 February 1997, Pages 209-232.

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

  175. D. Kratsch, L. Stewart. Total domination and transformation. Inform. Process. Lett. 63 (1997), no. 3, 167--170.

    1996

  176. A. Brandstadt, V. Chepoi, F. Dragan. Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics, Volume 158, Issues 1-3 , 15 October 1996, Pages 273-278.

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

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

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

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

  181. V. Chepoi. On distances in benzenoid systems. J. Chem. Inference Comput. Sci. 36 (1996) 1169-- 1172.

  182. 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).

  183. 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).

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

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

    1995

  186. P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. Graph-Theoretic Concepts in Computer Science, WG'95, volume 1017 of LNCS, pages 358--371, 1995.

  187. A. Brandstadt, V. Chepoi, F. Dragan. The algorithmic use of hypertree structure and maximum neighbourhood orderings. Graph-theoretic concepts in computer science (Herrsching, 1994), 65--80, Lecture Notes in Comput. Sci., 903, Springer, Berlin, 1995.

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

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

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

    1994 and before

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

  192. A.A. Zykov. Fundamentals of Graph Theory. BSC Associates, Moscow, IDAHO USA (1990).

  193. A.A. Zykov. Fundamentals of Graph Theory. Nauka, Moscow, USSR (1987).