Adjoint functors in graph theory
classification
🧮 math.CO
cs.DMmath.CT
keywords
adjointfunctorscolouringsgraphsometheoryapplicationscircular
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.