Cubic graphs

The subclass of graphs called cubic graphs is examined. Many classes of graphs have been studied in computer science and mathematics yet few classes seem as simple and interesting as cubic graphs. Cubic graphs are connected graphs having the property that each node has degree exactly 3. These graphs and their history are surveyed. Several classical graph theory results concerning cubic graphs are explained. Graph theory problems whose solutions on cubic graphs are particularly important or interesting are presented from both the sequential and parallel point of view. A new algorithm is presented for the maximal matching problem restricted to cubic graphs. Many miscellaneous facts about cubic graphs are also described.