Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dmitry A. Shabanov
2010 – today
- 2012
[j6]
[j5]Dmitry A. Shabanov: Random coloring method in the combinatorial problem of Erdős and Lovász. Random Struct. Algorithms 40(2): 227-253 (2012)- 2011
[j4]Anastasia P. Rozovskaya, Dmitry A. Shabanov: On colorings of non-uniform hypergraphs without short cycles. Electronic Notes in Discrete Mathematics 38: 749-754 (2011)
[j3]Dmitry A. Shabanov: On a generalization of Rubin's theorem. Journal of Graph Theory 67(3): 226-234 (2011)
2000 – 2009
- 2009
[j2]Anastasia P. Rozovskaya, Dmitry A. Shabanov: On the Problem of Erdos and Hajnal in the Case of List Colorings. Electronic Notes in Discrete Mathematics 34: 387-391 (2009)- 2007
[j1]Dmitry A. Shabanov: On Some Extremal Properties of Hypergraph Colorings. Electronic Notes in Discrete Mathematics 29: 97-100 (2007)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:19 CET by the dblp team



