BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Jump to: 2016
    Number of items: 1.

    2016

    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 Dec 1 04:37:23 2020 GMT.