Vitaly I. Voloshin

Publication Activity (10 Years)

Years Active: 1993-2021
Publications (10 Years): 8

Top Topics

Tree Structures

Hypergraph Model

Desirable Properties

Top Venues

Australas. J Comb.

Publications

György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin
Coloring Properties of Mixed Cycloids. Symmetry 13 (8) (2021)
Julian A. Allagan, Vitaly I. Voloshin
ℱ-WORM colorings of some 2-trees: partition vectors. Ars Math. Contemp. 16 (1) (2019)
Ping Zhao, Fuliang Lu, Vitaly I. Voloshin, Kefeng Diao
On the Structure of Uniform One-Realizations of a Given Set. Graphs Comb. 34 (1) (2018)
Kefeng Diao, Fuliang Lu, Vitaly I. Voloshin, Ping Zhao
The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. Graphs Comb. 33 (4) (2017)
Julian A. Allagan, Vitaly I. Voloshin
Coloring k-trees with forbidden monochrome or rainbow triangles. Australas. J Comb. 65 (2016)
David Slutzky, Vitaly I. Voloshin
The Chromatic Spectrum of a Ramsey Mixed Hypergraph. Comput. Sci. J. Moldova 24 (2) (2016)
Kefeng Diao, Vitaly I. Voloshin, Bing Xue, Ping Zhao
On perfection and imperfection of one-realizations of a given set. Discret. Math. 339 (10) (2016)
Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao
The smallest one-realization of a given set IV. Discret. Math. 338 (5) (2015)
Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Vitaly I. Voloshin
Feasible sets of small bicolorable STSs. Australas. J Comb. 59 (2014)
Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin
Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31 (2) (2011)
Vitaly I. Voloshin, Heinz-Jürgen Voss
Circular mixed hypergraphs II: The upper chromatic number. Discret. Appl. Math. 154 (8) (2006)
Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin
A Note on Quasi-triangulated Graphs. SIAM J. Discret. Math. 20 (3) (2006)
Kenneth J. Roblee, Vitaly I. Voloshin
Note about the upper chromatic number of mixed hypertrees. Comput. Sci. J. Moldova 13 (2) (2005)
Mario Gionfriddo, Lorenzo Milazzo, Alexander Rosa, Vitaly I. Voloshin
). Discret. Math. 283 (1-3) (2004)
Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman
Plucking Stirling Numbers from Trees: 10976. Am. Math. Mon. 111 (5) (2004)
Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin
Strict colorings of Steiner triple and quadruple systems: a survey. Discret. Math. 261 (1-3) (2003)
Zsolt Tuza, Vitaly I. Voloshin
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types. Comput. Sci. J. Moldova 11 (1) (2003)
Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin
Unique colorings of bi-hypergraphs. Australas. J Comb. 27 (2003)
Dmitrii Lozovanu, Vitaly I. Voloshin, Alex Zelikovsky
A note on the colorability of mixed hypergraph using k colors. Comput. Sci. J. Moldova 10 (1) (2002)
Zsolt Tuza, Vitaly I. Voloshin, Huishan Zhou
Uniquely colorable mixed hypergraphs. Discret. Math. 248 (1-3) (2002)
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
The Chromatic Spectrum of Mixed Hypergraphs. Graphs Comb. 18 (2) (2002)
Vitaly I. Voloshin
Problem 10976. Am. Math. Mon. 109 (9) (2002)
Mario Gionfriddo, Lorenzo Milazzo, Vitaly I. Voloshin
On the upper chromatic index of a multigraph. Comput. Sci. J. Moldova 10 (1) (2002)
Angela Niciilitsa, Vitaly I. Voloshin, Heinz-Jürgen Voss
Circular and uniquely colorable mixed hypergraphs. Electron. Notes Discret. Math. 8 (2001)
Marco Buratti, Mario Gionfriddo, Lorenzo Milazzo, Vitaly I. Voloshin
- 1). Comput. Sci. J. Moldova 9 (2) (2001)
Vitaly I. Voloshin
Greedy Algorithms for the Lower and Upper Chromatic Numbers. DMTCS (2001)
Salvatore Milici, Alexander Rosa, Vitaly I. Voloshin
Colouring Steiner systems with specified block colour patterns. Discret. Math. 240 (1-3) (2001)
Angela Niculitsa, Vitaly I. Voloshin
About uniquely colorable mixed hypertrees. Discuss. Math. Graph Theory 20 (1) (2000)
Dmitrii Lozovanu, Vitaly I. Voloshin
Integer programming models for colorings of mixed hypergraphs. Comput. Sci. J. Moldova 8 (1) (2000)
André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin
Colouring Planar Mixed Hypergraphs. Electron. J. Comb. 7 (2000)
Zsolt Tuza, Vitaly I. Voloshin
Uncolorable Mixed Hypergraphs. Discret. Appl. Math. 99 (1-3) (2000)
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3 (1999)
Vitaly I. Voloshin, Huishan Zhou
Pseudo-chordal mixed hypergraphs. Discret. Math. 202 (1-3) (1999)
Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
Dually Chordal Graphs. SIAM J. Discret. Math. 11 (3) (1998)
Elena Bulgaru, Vitaly I. Voloshin
Mixed Interval Hypergraphs. Discret. Appl. Math. 77 (1) (1997)
Feodor F. Dragan, Vitaly I. Voloshin
Incidence Graphs of Biacyclic Hypergraphs. Discret. Appl. Math. 68 (3) (1996)
Vitaly I. Voloshin
On the upper chromatic number of a hypergraph. Australas. J Comb. 11 (1995)
Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
Dually Chordal Graphs. WG (1993)
Vitaly I. Voloshin
The mixed hypergraphs. Comput. Sci. J. Moldova 1 (1) (1993)