Show simple item record

dc.contributor.authorKorpelainen, Nicholas
dc.date.accessioned2018-03-19T13:15:03Z
dc.date.available2018-03-19T13:15:03Z
dc.date.issued2016-12-01
dc.identifier.citationKorpelainen, N. (2016) 'A New Graph Construction of Unbounded Clique-width', Electronic Notes in Discrete Mathematics, 56:31 .en
dc.identifier.issn15710653
dc.identifier.doi10.1016/j.endm.2016.11.005
dc.identifier.urihttp://hdl.handle.net/10545/622379
dc.description.abstractWe 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.
dc.description.sponsorshipN/Aen
dc.language.isoenen
dc.publisherElsevieren
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1571065316302128en
dc.rightsArchived with thanks to Electronic Notes in Discrete Mathematicsen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectClique-widthen
dc.subjectHereditary classen
dc.subjectGraph theoryen
dc.titleA new graph construction of unbounded clique-width.en
dc.typeArticleen
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalElectronic Notes in Discrete Mathematicsen
html.description.abstractWe 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.


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record

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