Corrigendum to: `Complexity of diagrams'

DOI10.1007/BF01108833MaRDI QIDQ1319087zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, Vojtěch Rödl

Publication date 12 April 1994

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01108833

zbMATH Keywords

covering relationdiagramfinite posetNP- completenessundirected graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Review text

Concerns the authors' paper ibid. 3, 321-330 (1987), reviewed above.

Recommendations

• Corrigendum to ``The complexity of cubical graphs
• Corrigendum: The complexity of counting graph homomorphisms
• Corrigendum to: On ``On graph rewritings
• Corrigendum to: ``Complex adjacency matrix and energy of digraphs
• On the complexity of drawing trees nicely: Corrigendum
• Corrigendum to ``Completeness results for graph isomorphism
• Corrigendum: Orthogonal Tree Decompositions of Graphs
• Corrigendum to: ``Iterated stack automata and complexity classes
• scientific article; zbMATH DE number 617573

Cited in

(4)

• Corrigendum to: ``Iterated stack automata and complexity classes
• Dimension and height for posets with planar cover graphs.
• Contact graphs of boxes with unidirectional contacts
• Reply to ``On the Harker variation diagrams; \dots by J.A. Cortés

This page was built for publication: Corrigendum to: `Complexity of diagrams'

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319087)