Finiteness theorems for graphs and posets obtained by compositions
type: Item
instance of: scholarly article
title: Finiteness theorems for graphs and posets obtained by compositions
zbMATH Open document ID: 0939.06002
DOI: 10.1023/A:1006209905006
author: Jens Gustedt
published in: Order
publication date: 2000-07-05T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1340444
zbMATH Keywords: subgraphs
zbMATH Keywords: posets
zbMATH Keywords: decidability
zbMATH Keywords: linear algorithms
zbMATH Keywords: suborder
zbMATH Keywords: substitution decomposition
zbMATH Keywords: well-quasi-ordering
zbMATH Keywords: graphs
zbMATH Keywords: finiteness
zbMATH Keywords: minimal infinite antichains
zbMATH Keywords: fast algorithms
MaRDI profile type: Publication
full work available at URL: a:1006209905006
OpenAlex ID: W1600513108
description: scientific article; zbMATH DE number 1340444