Coverings and Colourings
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.
KeywordsBipartite Graph Connected Graph Chromatic Number Vertex Cover Hamiltonian Path
Unable to display preview. Download preview PDF.