( en | de | ru )

 

Disambiguation of "Lozin, Vadim V."

Author of the publication

copydeleteadd this publication to your clipboard
Corrigendum to "Locally bounded coverings and factorial properties of graphs" European J. Combin. 33(2012) 534-543.

, , and . Eur. J. Comb., (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vadim Vogelsang

Vadim Alekseev

Vadim Azhmyakov

Vadim Korotkov

Vadim Kopzon

 

Other publications of authors with the same name

The Clique-Width of Bipartite Graphs in Monogenic Classes., and . Int. J. Found. Comput. Sci., 19 (2): 477-494 (2008)WQO is decidable for factorial languages., , and . Inf. Comput., (2017)Graph Parameters and Ramsey Theory.. CoRR, (2016)Maximum Independent Sets in Subcubic Graphs: New Results., , , and . CoRR, (2018)On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs., , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 314-326. Springer, (2013)On the Clique-Width of Graphs in Hereditary Classes., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 44-54. Springer, (2002)Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes., , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 253-265. Springer, (2016)A Note on k-Colorability of P5-Free Graphs., , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 387-394. Springer, (2008)Deciding WQO for Factorial Languages., , and . LATA, volume 7810 of Lecture Notes in Computer Science, page 68-79. Springer, (2013)The 3-Colorability Problem on Graphs with Maximum Degree Four., , and . SIAM J. Comput., 32 (5): 1128-1139 (2003)