Finiteness theorems for graphs and posets obtained by compositions

From MaRDI portal

Publication:1304910

Jump to:navigation, search

DOI10.1023/A:1006209905006zbMath0939.06002OpenAlexW1600513108MaRDI QIDQ1304910

Jens Gustedt

Publication date: 5 July 2000

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006209905006

zbMATH Keywords

finiteness fast algorithms posets graphs decidability well-quasi-ordering linear algorithms subgraphs substitution decomposition suborder minimal infinite antichains

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Labelled well-quasi-order for permutation classes ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ Grid classes and partial well order ⋮ Inflations of geometric grid classes of permutations

This page was built for publication: Finiteness theorems for graphs and posets obtained by compositions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1304910&oldid=13415567"