Vitaly I. Voloshin

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