There has been much research on Hamiltonicity of cubic graphs.

It is known to be true for cubic graphs.

In other words a cubic graph is a 3-regular graph.

In the case of a cubic graph, this complex always forms a manifold.

It is the largest cubic graph with diameter 2.

It is therefore the first in an infinite family of similarly constructed cubic graphs.

However, the best known lower bound on the pathwidth of cubic graphs is smaller, 0.082n.

There exists 5 non-isomorphic cubic graphs of order 24 with crossing number 8.

It is a cubic graph: every vertex touches exactly three edges.

A 3-regular graph is known as a cubic graph.

The only hypercube that is a cubic graph is Q.

In a cubic graph, every cut vertex is an endpoint of at least one bridge.

The pathwidth of any n-vertex cubic graph is at most n/6.

However, integer-distance straight line embeddings are known to exist for cubic graphs.

Many of his results have become classical, including results about graph relations, 1-factors and cubic graphs.

It is the smallest bridgeless cubic graph with no Hamiltonian cycle.

In fact the problem remains NP-hard even when restricted to cubic graphs.

Each 4-connected (in the above sense) simple cubic graph on 2n nodes defines a class of quantum mechanical 3n-j symbols.

A Tait coloring is a 3-edge coloring of a cubic graph.

This cubic graph is strongly 4-colorable.

It is a bipartite symmetric cubic graph with 18 vertices and 27 edges.

A snark is a bridgeless cubic graph that requires four colors in any edge coloring.

The smallest 2-crossing cubic graph is the Petersen graph, with 10 vertices.

According to Vizing's theorem every cubic graph needs either three or four colors for an edge coloring.

Several researchers have studied the complexity of exponential time algorithms restricted to cubic graphs.