Name:
Publisher version
View Source
Access full-text PDFOpen Access
View Source
Check access options
Check access options
Authors
Korpelainen, Nicholas
Affiliation
University of DerbyIssue Date
2016-12-01
Metadata
Show full item recordAbstract
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipartite chain graph) by an induced linear forest. We show that this hereditary graph class is of of unbounded clique-width (with a new graph construction of large clique-width). We show that this graph class contains no minimal graph class of unbounded clique-width, and give a conjecture for a contained boundary class for this property.Citation
Korpelainen, N. (2016) 'A New Graph Construction of Unbounded Clique-width', Electronic Notes in Discrete Mathematics, 56:31 .Publisher
ElsevierJournal
Electronic Notes in Discrete MathematicsDOI
10.1016/j.endm.2016.11.005Additional Links
http://linkinghub.elsevier.com/retrieve/pii/S1571065316302128Type
ArticleLanguage
enISSN
15710653ae974a485f413a2113503eed53cd6c53
10.1016/j.endm.2016.11.005
Scopus Count
Collections
The following license files are associated with this item:
- Creative Commons
Except where otherwise noted, this item's license is described as Archived with thanks to Electronic Notes in Discrete Mathematics