Vitaly I. Voloshin

According to our database1, Vitaly I. Voloshin authored at least 37 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
ℱ-WORM colorings of some 2-trees: partition vectors.
Ars Math. Contemp., 2019

2018
On the Structure of Uniform One-Realizations of a Given Set.
Graphs Comb., 2018

2017
The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set.
Graphs Comb., 2017

2016
On perfection and imperfection of one-realizations of a given set.
Discret. Math., 2016

The Chromatic Spectrum of a Ramsey Mixed Hypergraph.
Comput. Sci. J. Moldova, 2016

Coloring k-trees with forbidden monochrome or rainbow triangles.
Australas. J Comb., 2016

2015
The smallest one-realization of a given set IV.
Discret. Math., 2015

2014
Feasible sets of small bicolorable STSs.
Australas. J Comb., 2014

2011
Color-bounded hypergraphs, V: host graphs and subdivisions.
Discuss. Math. Graph Theory, 2011

2006
A Note on Quasi-triangulated Graphs.
SIAM J. Discret. Math., 2006

Circular mixed hypergraphs II: The upper chromatic number.
Discret. Appl. Math., 2006

2005
Note about the upper chromatic number of mixed hypertrees.
Comput. Sci. J. Moldova, 2005

2004
Plucking Stirling Numbers from Trees: 10976.
Am. Math. Mon., 2004

Bicolouring Steiner systems <i>S</i>(2, 4, <i>v</i>).
Discret. Math., 2004

2003
Strict colorings of Steiner triple and quadruple systems: a survey.
Discret. Math., 2003

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.
Comput. Sci. J. Moldova, 2003

Unique colorings of bi-hypergraphs.
Australas. J Comb., 2003

2002
Problem 10976.
Am. Math. Mon., 2002

The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb., 2002

Uniquely colorable mixed hypergraphs.
Discret. Math., 2002

A note on the colorability of mixed hypergraph using k colors.
Comput. Sci. J. Moldova, 2002

On the upper chromatic index of a multigraph.
Comput. Sci. J. Moldova, 2002

2001
Circular and uniquely colorable mixed hypergraphs.
Electron. Notes Discret. Math., 2001

Colouring Steiner systems with specified block colour patterns.
Discret. Math., 2001

Lower and upper chromatic numbers for BSTSs(2<sup>h</sup> - 1).
Comput. Sci. J. Moldova, 2001

Greedy Algorithms for the Lower and Upper Chromatic Numbers.
Proceedings of the Combinatorics, 2001

2000
About uniquely colorable mixed hypertrees.
Discuss. Math. Graph Theory, 2000

Uncolorable Mixed Hypergraphs.
Discret. Appl. Math., 2000

Integer programming models for colorings of mixed hypergraphs.
Comput. Sci. J. Moldova, 2000

Colouring Planar Mixed Hypergraphs.
Electron. J. Comb., 2000

1999
Chromatic spectrum is broken.
Electron. Notes Discret. Math., 1999

Pseudo-chordal mixed hypergraphs.
Discret. Math., 1999

1998
Dually Chordal Graphs.
SIAM J. Discret. Math., 1998

1997
Mixed Interval Hypergraphs.
Discret. Appl. Math., 1997

1996
Incidence Graphs of Biacyclic Hypergraphs.
Discret. Appl. Math., 1996

1995
On the upper chromatic number of a hypergraph.
Australas. J Comb., 1995

1993
The mixed hypergraphs.
Comput. Sci. J. Moldova, 1993


  Loading...