Volume 84, Issue 4 p. 501-511
Article

Linear Clique‐Width for Hereditary Classes of Cographs

Robert Brignall

DEPARTMENT OF MATHEMATICS AND STATISTICS, THE OPEN UNIVERSITY, MILTON KEYNES, UNITED KINGDOM

Contract grant sponsor: EPSRC; contract grant number: EP/J006130/1; Contract grant sponsor: NSA; contract grant number: H98230‐12‐1‐0207; Contract grant sponsor: NSF; contract grant number: DMS‐1301692. The United States Government is authorized to reproduce and distribute reprints not‐withstanding any copyright notation herein.

Search for more papers by this author
Nicholas Korpelainen

MATHEMATICS DEPARTMENT, UNIVERSITY OF DERBY, DERBY, UNITED KINGDOM

Search for more papers by this author
Vincent Vatter

DEPARTMENT OF MATHEMATICS, UNIVERSITY OF FLORIDA, GAINESVILLE, FL UNITED STATES OF AMERICA

Search for more papers by this author
First published: 28 March 2016
Citations: 5

Abstract

The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only if it does not contain all quasi‐threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.