Theories

The Boyce-Codd Normal Form is stronger than 3rd Normal Form
A tree with n nodes has n+1 edges
A graph in which every node is of even degree is a Hamiltonian graph
The formal language useful in defining the syntax of programming languages is Context-Free Languages
The sum of degrees of all nodes in a graph is always odd