Adjoint functors and tree duality

zbMath1196.05035arXiv0805.2978MaRDI QIDQ3575461

Claude Tardif, Jan Foniok

Publication date: 27 July 2010

Full work available at URL: https://arxiv.org/abs/0805.2978

zbMATH Keywords

constraint satisfactionadjoint functortree duality

Mathematics Subject Classification ID

Trees (05C05) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Hedetniemi's conjecture and dense Boolean lattices ⋮ Interleaved adjoints of directed graphs ⋮ Digraph functors which admit both left and right adjoints ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ On cylindrical graph construction and its applications

This page was built for publication: Adjoint functors and tree duality