Adjoint functors in graph theory

MaRDI QIDQ6240987zbMATH OpenFDO

Authors Jan Foniok, Claude Tardif

Publication date 8 April 2013

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Abstract: We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the presentation to some extent, and also raises interesting questions.

This page was built for publication: Adjoint functors in graph theory

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