Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

DOI10.1016/j.dam.2021.02.007zbMath1460.05161arXiv1503.01628MaRDI QIDQ2661217

Aistis Atminas, Vadim V. Lozin, Juraj Stacho, Robert Brignall

Publication date: 1 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01628

zbMATH Keywords

well-quasi-ordering; clique-width; hereditary class; rank-width; universal graph

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)