2013/04/08 by Foniok, Jan, Tardif, Claude
#05C15 #18B35 #Category Theory (math.CT) #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1304.2215
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.