Partitions and Colourings

  • Ian Anderson
Part of the Springer Undergraduate Mathematics Series book series (SUMS)


In this chapter we consider partitions of a set, introducing the Stirling numbers and the Bell numbers. We then consider vertex and edge colourings of a graph, where the vertex set and the edge set are partitioned by the colours.


Bipartite Graph Chromatic Number Discrete Mathematic Vertex Degree Edge Colouring 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Ian Anderson
    • 1
  1. 1.Department of MathematicsUniversity of Glasgow, University GardensGlasgowUK

Personalised recommendations