Coverings and Colourings

  • L. R. Foulds
Part of the Universitext book series (UTX)


A graph theoretic concept of interest, both from the theoretical and practical points of view, is that of covering. A vertex (edge) of a graph is said to cover the edges (vertices) with which it is incident.


Bipartite Graph Connected Graph Chromatic Number Vertex Cover Hamiltonian Path 
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 Science+Business Media New York 1992

Authors and Affiliations

  • L. R. Foulds
    • 1
  1. 1.Department of Management SystemsUniversity of WaikatoHamiltonNew Zealand

Personalised recommendations