Cubic graphs

Since the sum efface sizes for a cubic graph must add up to 3n, it is not possible to achieve the required equality with hexagons, for... 

The problem of finding an algorithm for constructing all the valence isomers of the annulenes (CH)2i (k = 1,2,...) is equivalent to constructing all possible connected cubic graphs [51]. This was an... 

In accord with Balaban s values for the valence isomers of [2k] annulenes [51,93] both mathematicians [100a] and chemists [100b] have found consistent numerical values for cubic graphs and multigraphs. 

G. Brinkmann, /. Graph Theory, 23, 139 (1996). Fast Generation of Cubic Graphs. 

Fig. 12.1 A planar cubic graph with the diameter logarithmic in the number of vertices...

Corollary C Let G be a planar cubic graph on n vertices with the diameter D G). Then... 

Decker et al. [55] and Demarty et al. [61] considered the voxel representation as a 3D (cubic) graph which is constructed using the six-neighborhood of 3D images. 

---