The mixed hypergraphs. - Vitaly I. Voloshin (Comput. Sci. J. Moldova, 1993)

On the upper chromatic number of a hypergraph. - Vitaly I. Voloshin (Australas. J Comb., 1995)

Incidence Graphs of Biacyclic Hypergraphs. - Feodor F. Dragan; Vitaly I. Voloshin (Discret. Appl. Math., 1996)

Mixed Interval Hypergraphs. - Elena Bulgaru; Vitaly I. Voloshin (Discret. Appl. Math., 1997)

Dually Chordal Graphs. - Andreas Brandstädt; Feodor F. Dragan; Victor Chepoi; Vitaly I. Voloshin (SIAM J. Discret. Math., 1998)

Pseudo-chordal mixed hypergraphs. - Vitaly I. Voloshin; Huishan Zhou (Discret. Math., 1999)

Chromatic spectrum is broken. - Tao Jiang 003; Dhruv Mubayi; Zsolt Tuza; Vitaly I. Voloshin; Douglas B. West (Electron. Notes Discret. Math., 1999)

Colouring Planar Mixed Hypergraphs. - André Kündgen; Eric Mendelsohn; Vitaly I. Voloshin (Electron. J. Comb., 2000)

Integer programming models for colorings of mixed hypergraphs. - Dmitrii Lozovanu; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2000)

Uncolorable Mixed Hypergraphs. - Zsolt Tuza; Vitaly I. Voloshin (Discret. Appl. Math., 2000)

About uniquely colorable mixed hypertrees. - Angela Niculitsa; Vitaly I. Voloshin (Discuss. Math. Graph Theory, 2000)

Greedy Algorithms for the Lower and Upper Chromatic Numbers. - Vitaly I. Voloshin (DMTCS, 2001)

Lower and upper chromatic numbers for BSTSs(2h - 1). - Marco Buratti; Mario Gionfriddo; Lorenzo Milazzo 001; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2001)

Colouring Steiner systems with specified block colour patterns. - Salvatore Milici; Alexander Rosa; Vitaly I. Voloshin (Discret. Math., 2001)

Circular and uniquely colorable mixed hypergraphs. - Angela Niciilitsa; Vitaly I. Voloshin; Heinz-Jürgen Voss (Electron. Notes Discret. Math., 2001)

On the upper chromatic index of a multigraph. - Mario Gionfriddo; Lorenzo Milazzo 001; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2002)

A note on the colorability of mixed hypergraph using k colors. - Dmitrii Lozovanu; Vitaly I. Voloshin; Alex Zelikovsky (Comput. Sci. J. Moldova, 2002)

Uniquely colorable mixed hypergraphs. - Zsolt Tuza; Vitaly I. Voloshin; Huishan Zhou (Discret. Math., 2002)

The Chromatic Spectrum of Mixed Hypergraphs. - Tao Jiang 003; Dhruv Mubayi; Zsolt Tuza; Vitaly I. Voloshin; Douglas B. West (Graphs Comb., 2002)

Problem 10976. - Vitaly I. Voloshin (Am. Math. Mon., 2002)

Unique colorings of bi-hypergraphs. - Gábor Bacsó; Zsolt Tuza; Vitaly I. Voloshin (Australas. J Comb., 2003)

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types. - Zsolt Tuza; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2003)

Strict colorings of Steiner triple and quadruple systems: a survey. - Lorenzo Milazzo 001; Zsolt Tuza; Vitaly I. Voloshin (Discret. Math., 2003)

Bicolouring Steiner systems S(2, 4, v). - Mario Gionfriddo; Lorenzo Milazzo 001; Alexander Rosa; Vitaly I. Voloshin (Discret. Math., 2004)

Plucking Stirling Numbers from Trees: 10976. - Vitaly I. Voloshin; José Heber Nieto; Edward R. Scheinerman; Robin Chapman (Am. Math. Mon., 2004)

Note about the upper chromatic number of mixed hypertrees. - Kenneth J. Roblee; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2005)

Circular mixed hypergraphs II: The upper chromatic number. - Vitaly I. Voloshin; Heinz-Jürgen Voss (Discret. Appl. Math., 2006)

A Note on Quasi-triangulated Graphs. - Ion Gorgos; Chính T. Hoàng; Vitaly I. Voloshin (SIAM J. Discret. Math., 2006)

Color-bounded hypergraphs, V: host graphs and subdivisions. - Csilla Bujtás; Zsolt Tuza; Vitaly I. Voloshin (Discuss. Math. Graph Theory, 2011)

Feasible sets of small bicolorable STSs. - Mario Gionfriddo; Elena Guardo; Lorenzo Milazzo 001; Vitaly I. Voloshin (Australas. J Comb., 2014)

The smallest one-realization of a given set IV. - Kefeng Diao; Vitaly I. Voloshin; Kaishun Wang; Ping Zhao 005 (Discret. Math., 2015)

Coloring k-trees with forbidden monochrome or rainbow triangles. - Julian A. Allagan; Vitaly I. Voloshin (Australas. J Comb., 2016)

The Chromatic Spectrum of a Ramsey Mixed Hypergraph. - David Slutzky; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2016)

On perfection and imperfection of one-realizations of a given set. - Kefeng Diao; Vitaly I. Voloshin; Bing Xue; Ping Zhao 005 (Discret. Math., 2016)

The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. - Kefeng Diao; Fuliang Lu; Vitaly I. Voloshin; Ping Zhao 005 (Graphs Comb., 2017)

On the Structure of Uniform One-Realizations of a Given Set. - Ping Zhao 005; Fuliang Lu; Vitaly I. Voloshin; Kefeng Diao (Graphs Comb., 2018)

ℱ-WORM colorings of some 2-trees: partition vectors. - Julian A. Allagan; Vitaly I. Voloshin (Ars Math. Contemp., 2019)

Coloring Properties of Mixed Cycloids. - György Dósa; Nicholas Newman; Zsolt Tuza; Vitaly I. Voloshin (Symmetry, 2021)