Well-quasi-ordering versus clique-width
type: Item
instance of: scholarly article
title: Well-quasi-ordering versus clique-width
zbMATH Open document ID: 1384.05114
author: Igor Razgon
author: Vadim Lozin
author: Victor Zamaraev
published in: Journal of Combinatorial Theory. Series B
publication date: 2018-04-18T00:00:00Z
full work available at URL: WRAP-well-quasi-ordering-versus-clique-width-Lozin-2017.pdf
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6861267
zbMATH Keywords: well-quasi-ordering
zbMATH Keywords: induced subgraphs
zbMATH Keywords: clique-width
zbMATH Keywords: hereditary classes
MaRDI profile type: Publication
OpenAlex ID: W2762850984
cites work: Well-quasi-order for permutation graphs omitting a path and a clique
cites work: A model-theoretic characterisation of clique width
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: Well-quasi-order of relabel functions
cites work: Induced subgraphs and well‐quasi‐ordering
cites work: Well-structured transition systems everywhere!
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Well-quasi-ordering Does Not Imply Bounded Clique-width
cites work: Two forbidden induced subgraphs and well-quasi-ordering
cites work: Bipartite induced subgraphs and well-quasi-ordering
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: The relative clique-width of a graph
cites work: Letter graphs and well-quasi-order by induced subgraphs
cites work: Graph minors. IV: Tree-width and well-quasi-ordering
cites work: Graph minors. XX: Wagner's conjecture
DOI: 10.1016/J.JCTB.2017.09.012
description: scientific article; zbMATH DE number 6861267