BIROn - Birkbeck Institutional Research Online

    Well-quasi-ordering does not imply bounded cliquewidth

    Lozin, V.V. and Razgor, 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.

    [img]
    Preview
    Text
    15409.pdf - Author's Accepted Manuscript
    Available under License Creative Commons Attribution Non-commercial.

    Download (216kB) | Preview

    Abstract

    We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides the negative answer to a question asked by Daligault, Rao and Thomassé in [3].

    Metadata

    Item Type: Book Section
    Additional Information: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Series ISSN: 0302-9743. The final publication is available at Springer via the link above.
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 03 Jun 2016 09:53
    Last Modified: 02 Jun 2017 09:51
    URI: http://eprints.bbk.ac.uk/id/eprint/15409

    Statistics

    Downloads
    Activity Overview
    41Downloads
    77Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item