Corrigendum to: `Complexity of diagrams'
type: Item
instance of: scholarly article
title: Corrigendum to: `Complexity of diagrams'
zbMATH Open document ID: 0808.06005
DOI: 10.1007/BF01108833
author: J. Nešetřil
author: Vojtěch Rödl
published in: Order
publication date: 1994-04-12T00:00:00Z
review text: Concerns the authors' paper ibid. 3, 321-330 (1987), reviewed above.
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 549277
zbMATH Keywords: diagram
zbMATH Keywords: undirected graph
zbMATH Keywords: covering relation
zbMATH Keywords: finite poset
zbMATH Keywords: NP- completeness
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf01108833
OpenAlex ID: W4235069571
Recommended article: Corrigendum to ``The complexity of cubical graphs''
Recommended article: Corrigendum: The complexity of counting graph homomorphisms
Recommended article: Corrigendum to: On ``On graph rewritings''
Recommended article: Corrigendum to ‘Complex adjacency matrix and energy of digraphs’
Recommended article: On the complexity of drawing trees nicely: Corrigendum
Recommended article: Corrigendum to ``Completeness results for graph isomorphism''
Recommended article: Corrigendum: Orthogonal Tree Decompositions of Graphs
Recommended article: Corrigendum to: ``Iterated stack automata and complexity classes''
Recommended article: Q4301895
description: scientific article; zbMATH DE number 549277