Vitaly I. Voloshin - publications
Last Updated October 8, 2008 by Vitaly Voloshin

    2009

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

  2. V. Voloshin. Introduction to Graph Theory. Textbook. Nova Science Publishers, 2009.

  3. V.Voloshin. Untimely demise of Lucia Gionfriddo. Bulletin of the Institute of Combinatorics and its Applications. 55(2009), p.7-8.

    2008

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

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

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

    2007

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

    2006

  8. I. Gorgos, C. Hoang, V. Voloshin. A note on quasi-triangulated graphs. SIAM J. Discrete Math. 20 (2006), no. 3, 597--602.

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

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

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

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

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

  14. M. Gionfriddo, L. Milazzo, A. Rosa, V. Voloshin. Bicoloring Steiner systems S(2,4,v). Discrete Mathematics, Volume 283, Issues 1-3 , 6 June 2004, Pages 249-253.

    2003

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

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

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

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

    2002

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

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

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

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

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

  24. V.I. Voloshin, H.-J. Voss. Circular Mixed Hypergraphs II: The Upper Chromatic Number. Preprint TU Dresden, MATH-AL-2-2002, 1-26.

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

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

    2001

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

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

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

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

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

  32. 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), 211-221.

    2000

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

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

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

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

  37. V. Voloshin and 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.

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

    1999

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

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

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

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

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

  44. T. Jiang, D. Mubayi, V. Voloshin, Zs. Tuza 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.

    1998

  45. A. Brandstadt, V.D. Chepoi, F.F. Dragan, V.I. Voloshin. Dually chordal graphs. SIAM J. Discrete Math. 11 (1998), 437--455.

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

    1997

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

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

    1996

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

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

  51. F.F. Dragan, V.I. Voloshin. Incidence graphs of biacyclic hypergraphs, Discrete Applied Mathematics, 68 (1996) 259-266.

    1995

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

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

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

  55. V.I. Voloshin. On the upper chromatic number of a hypergraph. Australas. J. Combin. 11, (1995), 25-45.

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

    1994

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

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

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

  60. A. Brandstadt, V.D. Chepoi, F.F. Dragan, V.I. Voloshin. Dually chordal graphs. Graph-Theoretic Concepts in Computer Science, 19th International Workshop WG'93, Utrecht, The Netherlands, LNCS 790, Springer, Jan van Leuwen (Ed.), (1994), 237-251.

  61. V.I. Voloshin. A note on the conditional chromatic polynomial. Glasgo Mathematical Journal, 35 (1994), 265-267.

  62. V.I. Voloshin. A maximal lifetime of systems and co-perfect hypergraphs. Advances in Modelling and Analysis, A, AMSE Press, 20 (4) (1994), 1-18.

    1993

  63. V.I. Voloshin. On the conditional network scheduling. Advances in Modelling and Analysis, A, AMSE Press, 15 (1) (1993), 60-64.

  64. V.I. Voloshin. On the one case of channel network scheduling: an application of the conditional colorings of triangulated graphs. Advances in Modelling and Analysis, A, AMSE Press, 16 (3) (1993), 1-9.

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

    1992

  66. F.F. Dragan, V.I. Voloshin. Hypertrees and associated graphs. Technical Report DMC-MSU-0512, Moldova State University, (1992), 18p.

  67. V.I. Voloshin, F.F. Dragan, Ch.F. Prisacaru. Algorithms and Programs for Discrete Structures Visualization. Scientific research conference of the Moldova State University. Theses of Reports, Kishinev, (1992), Vol. 1, p.38, (in Russian).

  68. V.I. Voloshin, P.A. Anisimov, Ch.F. Prisacaru. Proofs representation in Graph Theory. Scientific research conference of the Moldova State University. Theses of Reports, Kishinev, (1992), Vol. 1, p.44, (in Russian).

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

    1991

  70. V.I. Voloshin. On one case of computing of the conditional chromatic polynomial. 6th Simposuim on general topology and its applications, Kishinev, (1991), p.24.

    1990

  71. V.I.Voloshin. Conditional chromatic polynomial. Research on Applied Mathematics and Informatics, Kishinev, Stiinta, (1990), 16-19, (in Russian).

  72. V.I. Voloshin. Generalized hypergraph cyclomatic number. Problems of mathematisation of the Moldavian SSR national economy, Kishinev, Stiinta, (1990), 27-31, (in Russian).

  73. V.I. Voloshin, F.F. Dragan, Ch.F. Prisacaru. Combinatorial and logical problems of computer-aided design. Methodical textbook, Kishinev State University, 18p., (1990), (in Russian).

  74. V.I. Voloshin. On the universality of triangulated graphs decomposition relatively to the colorings. Mathematical and programming aids in computer-aided design of the network informational systems, 95-98, (1990), Yoshkar-Ola, (in Russian).

  75. V.I. Voloshin, F.F. Dragan. Some properties of a hypertrees and their applications. Methods and software of optimization, modeling and creating of computational systems, 19-21, (1990), Kiev, (in Russian).

  76. V.I. Voloshin. On the Vizing-Wilf number of the quasi-triangulated graphs. Scientific research conference of the Moldova State University. Theses of reports, Kishinev, (1990), p.50, (in Russian).

  77. V.I. Voloshin, I.G. Miron, Ch.F. Prisacaru, A.F.Prisacaru. Construction of the computer manual "Logical-combinatorial methods in Computer Aided Design". Scientific research conference of the Moldova State University. Theses of Reports, Kishinev, (1990), p.50, (in Russian).

    1989

  78. V.I. Voloshin. Conditional Coloring Polynomial. Methods and Programs of resolving of optimization problems on graphs and networks, part 1. Algorithms, Programs, Applications. Theses of reports of the 4th All-Union Conference 17-19 October 1989, Novosibirsk, (1989), p.32, (in Russian).

  79. Ch.F. Prisacaru, A.F. Prisacaru, V.I. Voloshin, M.E. Nischiy, L.V. Stadler. Automated job place of the doctor-organizer for the new economical conditions of the work. All-Union Conference " Applications of the Personal Computers in non-industrial sphere", Moscow, (1989), 87-88, (in Russian).

    1988

  80. V.I. Voloshin, S.M. Caisyn. The main directions of the computerization of the educational process, scientific research and the management. In " Applications of the economical-mathematical methods and computer aids in planning and management of the national economy of the Moldavian SSR", Kishinev, (1988), p.12, (in Russian).

  81. V.I. Voloshin. Hypertrees, generalized hypergraph cyclomatic number and triangulated graphs. Preprint No 933-M-88, Kishinev State University, 12p., (1988), (in Russian).

    1986

  82. V.I. Voloshin, Ch.F. Prisacaru, S.V. Maximilian, V.K. Agafitsa. Determination algorithm for goal values of direct expenditures. Models and algorithms of Automated Management Systems, Kishinev, Stiinta, (1986), 12-20, (in Russian).

    1985

  83. V.I. Voloshin. On the cyclomatic number of a hypergraph. 7th All-Union Conference "Problems of a theoretic cybernetics", Theses of reports. Part 2. Irkutsk, (1985), 30-31, (in Russian).

  84. V.I. Voloshin, I.V. Zonov, S.A. Filimonov. Algorithms and software of the computational problems of the electroacustic tract of the special non-destroying control device. In "Scientists of the high education institutions of Moldavia to the national economy", Kishinev, (1985), p.16, (in Russian).

  85. V.I. Voloshin., Ch.F. Prisacaru, O.I. Topala, A.F. Godonoaga. Mathematical bases of cybernetics, Methodical textbook, Kishinev University, 33p., (1985), (in Russian).

    1984

  86. V.I. Voloshin, V.P. Soltan. Ptolemaic graphs recognition program. "Algorithms and Programs", No 3, Moscow, (1984), abstract 3.069, No P007074. 12p., (in Russian).

  87. V.I. Voloshin, V.P. Soltan. Recognition program for belonging of the function on graph to the classes of d-convex, d-affine, d-quasi-convex and d-quasi-affine functions. "Algorithms and Programs", No 3, Moscow, (1984), abstract 3.070, No P007075. 9p., (in Russian).

  88. V.I. Voloshin, V.P. Soltan. Construction program for a d-convex hull of the subset of vertices of graph. "Algorithms and Programs", No 3, Moscow, (1984), abstract 3.071, No P007076. 9p., (in Russian).

    1983

  89. V.I. Voloshin. Quasi-triangulated graphs recognition program. Informational Bulletin of the State Algorithms and Programs Fund of the USSR "Algorithms and Programs", No 3, Moscow, (1983), abstract 3.058, No P006124. 9p., (in Russian).

  90. V.I. Voloshin. Density and coloring finding program for quasi-triangulated graphs. "Algorithms and Programs", No 3, Moscow, (1983), abstract 3.059, No P006125. 9p., (in Russian).

  91. V.I. Voloshin. Program for finding a minimal transversal and a maximal matching of a hypertree. "Algorithms and Programs", No 3, Moscow, (1983), abstract 3.060, No P006126. 9p., (in Russian).

  92. V.I. Voloshin. Program for recognition and coloring of a hypertree. "Algorithms and Programs", No 3, Moscow, (1983), abstract 3.061, No P006127. 9p., (in Russian).

  93. V.I. Voloshin. Triangulated graphs and their generalizations. Ph.D. Thesis abstract, Cybernetics Institute, Kiev, (1983), 14p., (in Russian).

  94. V.I. Voloshin. Triangulated graphs and their generalizations. Ph.D. Thesis, Kishinev State University, (1983), 97p., (in Russian).

    1982

  95. V.I. Voloshin. Properties of triangulated graphs. Operation research and programming, Kishinev, Stiinta, (1982), p. 24-32, (in Russian).

  96. V.I. Voloshin, I.M.Gorgos. Some properties of weakly-connected hypergraphs and their applications. Mat. Issled. 66, 30-33, (1982), (in Russian).

  97. V.I. Voloshin. Algorithms on hypertrees and triangulated hypergraphs. Methods and Programs of resolving of optimization problems on graphs and networks, part 2. Theory, Algorithms. Theses of reports of 2nd All-Union Conference 24-26 August 1982, Ulan-Udae. Novosibirsk, (1982), 27-29, (in Russian).

  98. V.I. Voloshin. Chromatic and dimensional polynomials of triangulated graphs. Mat. Issled. 66, Kishinev, Stiinta, (1982), 24-29, (in Russian).

  99. V.I. Voloshin. Hypergraphs - trees. Preprint No 1516-82 Dep., Kishinev University, 19 p., (1982) (in Russian).

    1981

  100. V.I. Voloshin. Quasi-triangulated graphs. Preprint No 5569-81 Dep., Kishinev University, 11p., (1981), (in Russian).

  101. V.I. Voloshin. Distances in triangulated graphs. 9th Conference of the Mathematicians of Georgia. Theses, Batumy, 21-25 December (1981), p. 103 (in Russian).

Back to Home Page