The Library
Well-quasi-ordering does not imply bounded clique-width
Tools
Lozin, Vadim V., Razgon, Igor and Zamaraev, Viktor (2016) Well-quasi-ordering does not imply bounded clique-width. In: WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science , Garching, 17 - 19 Jun 2015. Published in: Proceeding WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9224, 9224 pp. 351-359. ISBN 9783662531730 . doi:10.1007/978-3-662-53174-7_25 ISSN 0302-9743.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/978-3-662-53174-7_25
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].
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Proceeding WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9224 | ||||
ISBN: | 9783662531730 | ||||
ISSN: | 0302-9743 | ||||
Book Title: | Graph-Theoretic Concepts in Computer Science | ||||
Official Date: | 2016 | ||||
Dates: |
|
||||
Volume: | 9224 | ||||
Page Range: | pp. 351-359 | ||||
DOI: | 10.1007/978-3-662-53174-7_25 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | WG 2015 Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science | ||||
Type of Event: | Conference | ||||
Location of Event: | Garching | ||||
Date(s) of Event: | 17 - 19 Jun 2015 |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |