Adjoint functors in graph theory
Combinatorics
2013-04-09 v1 Discrete Mathematics
Category Theory
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.
Cite
@article{arxiv.1304.2215,
title = {Adjoint functors in graph theory},
author = {Jan Foniok and Claude Tardif},
journal= {arXiv preprint arXiv:1304.2215},
year = {2013}
}
Comments
14 pages