Generalised Dualities and Finite Maximal Antichains
From MaRDI portal
Publication:3522939
DOI10.1007/11917496_3zbMath1167.05319OpenAlexW1528695555MaRDI QIDQ3522939
Jaroslav Nešetřil, Claude Tardif, Jan Foniok
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_3
Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
No finite-infinite antichain duality in the homomorphism poset of directed graphs ⋮ On Finite Maximal Antichains in the Homomorphism Order
This page was built for publication: Generalised Dualities and Finite Maximal Antichains
