Illustrating a Graph Coloring Algorithm Based on the Principle of Inclusion and Exclusion Using GraphTea

  • M. Ali Rostami
  • H. Martin Bücker
  • Azin Azadi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8719)


Graph theory is becoming increasingly important in various scientific disciplines. The graph coloring problem is an abstraction of partitioning entities in the presence of conflicts. It is therefore among the most prominent problems in graph theory with a wide range of different application areas. The importance of graph coloring has led to the development of various algorithms to cope with the high computational complexity of this NP-complete problem. A comprehensive understanding of existing algorithms is not only crucial to future algorithm research in this area, but also beneficial to the education of students in mathematics and computer science. To better explain sophisticated graph coloring algorithms, this paper proposes the educational tool GraphTea. More precisely, we demonstrate the design of GraphTea to illustrate a recent graph coloring algorithm based on the principle of inclusion and exclusion. Our experiences indicate that GraphTea makes teaching this algorithm in classroom easier.


Graph Theory Chromatic Number Graph Coloring High Computational Complexity Cholesky Factorization 
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.


  1. 1.
    Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing 39(2), 546–563 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bücker, H.M., Rostami, M.A.: Interactively exploring the connection between nested dissection orderings for parallel Cholesky factorization and vertex separators. In: IEEE 28th Int. Par. & Dist. Process. Symp., IPDPS 2014 Workshops, Phoenix, USA, May 19–23, 2014, Los Alamitos, USA, pp. 1122–1129. IEEE Computer Society Press, Los Alamitos (2014)Google Scholar
  3. 3.
    Carbonneaux, Y., Laborde, J.-M., Madani, R.M.: CABRI-Graph: A tool for research and teaching in graph theory. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 123–126. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  4. 4.
    Lambert, A., Auber, D.: Graph analysis and visualization with Tulip-Python. In: 5th Europ. meeting Python in science, EuroSciPy 2012, Bruxelles, Belgium (2012)Google Scholar
  5. 5.
    Rostami, M.A., Azadi, A., Seydi, M.: GraphTea: Interactive Graph Self-Teaching Tool. In: Proc. 2014 Int. Conf. Edu. & Educat. Technol. II, pp. 48–52 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • M. Ali Rostami
    • 1
  • H. Martin Bücker
    • 1
  • Azin Azadi
    • 2
  1. 1.Institute for Computer ScienceFriedrich Schiller University JenaJenaGermany
  2. 2.Jovoto CompanyBerlin

Personalised recommendations