Corrigendum to: `Complexity of diagrams'

DOI10.1007/BF01108833zbMath0808.06005OpenAlexW4235069571MaRDI QIDQ1319087

Vojtěch Rödl, Jaroslav Nešetřil

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

diagramfinite posetcovering relationundirected graphNP- completeness

Mathematics Subject Classification ID

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

Related Items (1)

Dimension and height for posets with planar cover graphs.

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