Mathematically, a (directed) graph is a pair \(G=(V,E)\) where \(V\) is a set of vertices and \(E\) is a set of ordered pairs of vertices called edges. For example, in a university setting we might ha...Mathematically, a (directed) graph is a pair \(G=(V,E)\) where \(V\) is a set of vertices and \(E\) is a set of ordered pairs of vertices called edges. For example, in a university setting we might have a timetable conflict graph whose vertices represent courses offered in the university and in which the edge \(\mathtt{(i,j)}\) is present if and only if there is at least one student that is taking both class \(\mathtt{i}\) and class \(\mathtt{j}\).
