| This thesis introduces and studies a class of graphs called k-sparse graphs. A graph H is a minor of a graph G if H can be obtained from G by a sequence of edge deletions and edge contractions. A simple graph is a graph having no loops or multiple edges. A graph G is k-sparse if every simple minor of G, with k + 2 or more points, contains two non-adjacent points of degree ;The union of two graphs G... |
