A new graph construction of unbounded clique-width.

Thumbnail
Name:
Publisher version
Authors
Korpelainen, Nicholas cc
Affiliation
University of Derby
Issue Date
2016-12-01

Metadata
Show full item record
Abstract
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
Elsevier
Journal
Electronic Notes in Discrete Mathematics
URI
http://hdl.handle.net/10545/622379
DOI
10.1016/j.endm.2016.11.005
Additional Links
http://linkinghub.elsevier.com/retrieve/pii/S1571065316302128
Type
Article
Language
en
ISSN
15710653
Collections

The following license files are associated with this item:

  • Creative Commons
Archived with thanks to Electronic Notes in Discrete Mathematics
Except where otherwise noted, this item's license is described as Archived with thanks to Electronic Notes in Discrete Mathematics