Conjecture   There exists a fixed constant so that every -vertex cubic graph without a cut-edge has at least perfect matchings.

Problem   Let be a cyclically 4-edge-connected cubic graph and let be a cycle of . Must there exist a cycle so that ?

Conjecture   Every bridgeless cubic graph has two perfect matchings , so that does not contain an odd edge-cut.

Conjecture   Every 3-connected cubic planar bipartite graph is Hamiltonian.

Question   Let be a 3-regular graph that contains no cycle of length shorter than . Is it true that for large enough~ there is a homomorphism ?

Conjecture   Let be a cubic graph with no bridge. Then there is a coloring of the edges of using the edges of the Petersen graph so that any three mutually adjacent edges of map to three mutually adjancent edges in the Petersen graph.

Conjecture   If is a bridgeless cubic graph, then there exist 6 perfect matchings of with the property that every edge of is contained in exactly two of .

Conjecture   Every bridgeless graph has a nowhere-zero 5-flow.