default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly I. Voloshin
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]György Dósa
, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin:
Coloring Properties of Mixed Cycloids. Symmetry 13(8): 1539 (2021)
2010 – 2019
- 2019
- [j36]Julian A. Allagan, Vitaly I. Voloshin:
ℱ-WORM colorings of some 2-trees: partition vectors. Ars Math. Contemp. 16(1): 173-182 (2019) - 2018
- [j35]Ping Zhao, Fuliang Lu, Vitaly I. Voloshin, Kefeng Diao:
On the Structure of Uniform One-Realizations of a Given Set. Graphs Comb. 34(1): 129-138 (2018) - 2017
- [j34]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): 869-883 (2017) - 2016
- [j33]Julian A. Allagan, Vitaly I. Voloshin:
Coloring k-trees with forbidden monochrome or rainbow triangles. Australas. J Comb. 65: 137-151 (2016) - [j32]David Slutzky, Vitaly I. Voloshin:
The Chromatic Spectrum of a Ramsey Mixed Hypergraph. Comput. Sci. J. Moldova 24(2): 213-233 (2016) - [j31]Kefeng Diao, Vitaly I. Voloshin, Bing Xue, Ping Zhao:
On perfection and imperfection of one-realizations of a given set. Discret. Math. 339(10): 2417-2422 (2016) - 2015
- [j30]Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao:
The smallest one-realization of a given set IV. Discret. Math. 338(5): 712-724 (2015) - 2014
- [j29]Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Vitaly I. Voloshin:
Feasible sets of small bicolorable STSs. Australas. J Comb. 59: 107-119 (2014) - 2011
- [j28]Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin:
Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31(2): 223-238 (2011)
2000 – 2009
- 2006
- [j27]Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular mixed hypergraphs II: The upper chromatic number. Discret. Appl. Math. 154(8): 1157-1172 (2006) - [j26]Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin:
A Note on Quasi-triangulated Graphs. SIAM J. Discret. Math. 20(3): 597-602 (2006) - 2005
- [j25]Kenneth J. Roblee, Vitaly I. Voloshin:
Note about the upper chromatic number of mixed hypertrees. Comput. Sci. J. Moldova 13(2): 131-135 (2005) - 2004
- [j24]Mario Gionfriddo, Lorenzo Milazzo, Alexander Rosa, Vitaly I. Voloshin:
Bicolouring Steiner systems S(2, 4, v). Discret. Math. 283(1-3): 249-253 (2004) - [j23]Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman:
Plucking Stirling Numbers from Trees: 10976. Am. Math. Mon. 111(5): 444-445 (2004) - 2003
- [j22]Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin:
Unique colorings of bi-hypergraphs. Australas. J Comb. 27: 33-46 (2003) - [j21]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): 35-42 (2003) - [j20]Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin:
Strict colorings of Steiner triple and quadruple systems: a survey. Discret. Math. 261(1-3): 399-411 (2003) - 2002
- [j19]Mario Gionfriddo, Lorenzo Milazzo, Vitaly I. Voloshin:
On the upper chromatic index of a multigraph. Comput. Sci. J. Moldova 10(1): 81-91 (2002) - [j18]Dmitrii Lozovanu, Vitaly I. Voloshin, Alex Zelikovsky:
A note on the colorability of mixed hypergraph using k colors. Comput. Sci. J. Moldova 10(1): 92-95 (2002) - [j17]Zsolt Tuza, Vitaly I. Voloshin, Huishan Zhou:
Uniquely colorable mixed hypergraphs. Discret. Math. 248(1-3): 221-236 (2002) - [j16]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
The Chromatic Spectrum of Mixed Hypergraphs. Graphs Comb. 18(2): 309-318 (2002) - [j15]Vitaly I. Voloshin:
Problem 10976. Am. Math. Mon. 109(9): 855 (2002) - 2001
- [j14]Marco Buratti, Mario Gionfriddo, Lorenzo Milazzo, Vitaly I. Voloshin:
Lower and upper chromatic numbers for BSTSs(2h - 1). Comput. Sci. J. Moldova 9(2): 259-272 (2001) - [j13]Salvatore Milici, Alexander Rosa, Vitaly I. Voloshin:
Colouring Steiner systems with specified block colour patterns. Discret. Math. 240(1-3): 145-160 (2001) - [j12]Angela Niciilitsa, Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular and uniquely colorable mixed hypergraphs. Electron. Notes Discret. Math. 8: 115-118 (2001) - [c2]Vitaly I. Voloshin:
Greedy Algorithms for the Lower and Upper Chromatic Numbers. DMTCS 2001: 241-251 - 2000
- [j11]André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin:
Colouring Planar Mixed Hypergraphs. Electron. J. Comb. 7 (2000) - [j10]Dmitrii Lozovanu, Vitaly I. Voloshin:
Integer programming models for colorings of mixed hypergraphs. Comput. Sci. J. Moldova 8(1): 64-74 (2000) - [j9]Zsolt Tuza, Vitaly I. Voloshin:
Uncolorable Mixed Hypergraphs. Discret. Appl. Math. 99(1-3): 209-227 (2000) - [j8]Angela Niculitsa, Vitaly I. Voloshin:
About uniquely colorable mixed hypertrees. Discuss. Math. Graph Theory 20(1): 81-91 (2000)
1990 – 1999
- 1999
- [j7]Vitaly I. Voloshin, Huishan Zhou:
Pseudo-chordal mixed hypergraphs. Discret. Math. 202(1-3): 239-248 (1999) - [j6]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3: 86-89 (1999) - 1998
- [j5]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. SIAM J. Discret. Math. 11(3): 437-455 (1998) - 1997
- [j4]Elena Bulgaru, Vitaly I. Voloshin:
Mixed Interval Hypergraphs. Discret. Appl. Math. 77(1): 29-41 (1997) - 1996
- [j3]Feodor F. Dragan, Vitaly I. Voloshin:
Incidence Graphs of Biacyclic Hypergraphs. Discret. Appl. Math. 68(3): 259-266 (1996) - 1995
- [j2]Vitaly I. Voloshin:
On the upper chromatic number of a hypergraph. Australas. J Comb. 11: 25-46 (1995) - 1993
- [j1]Vitaly I. Voloshin:
The mixed hypergraphs. Comput. Sci. J. Moldova 1(1): 45-52 (1993) - [c1]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. WG 1993: 237-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
