Browse by Person

Group by: Item Type | Date | Journal or Publication Title | No Grouping

Number of items: 3.

Lozin, V. and Razgon, Igor and Zamaraev, V. and Zamaraeva, E. and Zolotykh, N. (2018) Linear read-once and related Boolean functions. Discrete Applied Mathematics 250 (11), pp. 16-27. ISSN 0166-218X.

Lozin, V. and Razgon, Igor and Zamaraev, V. (2018) Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory Series B 130 , pp. 1-18. ISSN 0095-8956.

Lozin, V.V. and Razgon, Igor and Zamaraev, V. (2016) Well-quasi-ordering does not imply bounded cliquewidth. In: Mayr, E.W. (ed.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science 9224. New York, U.S.: Springer, pp. 351-359. ISBN 9783662531730.

This list was generated on Tue Jun 10 02:36:08 2025 BST.

Export as	Atom RSS