Browse by Person

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

Number of items: 1.

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 Sat Nov 23 06:18:41 2024 GMT.

Export as	Atom RSS