Introduction to the Minimum Rainbow Subgraph problem

Matos Camacho, Stephan

Introduction to the Minimum Rainbow Subgraph problem

Matos Camacho, S.

Consider an p edge coloured graph G, then a Minimum Rainbow Subgraph is a subgraph H of G of minimum order, such that every colour occurs in H. This phd thesis provides a comprehensive introduction to this problem.

Keywords: graph theory; chromatic index; colouring

Doctoral thesis
TU Bergakademie Freiberg, 2012
Mentor: Prof. Dr. Ingo Schiermeyer
59 Seiten

Permalink: https://www.hzdr.de/publications/Publ-20518