Carbon hexagonal lattice. As of 2009, graphene appears to be the strongest material ever tested. The process of separating it from graphite will require some further technological development before it is economical for industrial processes. If successful, graphene could be used in the construction of a space elevator. It could also be used to safely store hydrogen for use in a hydrogen based engine in cars. The amorphous form is an assortment of carbon atoms in a non-crystalline, irregular, glassy state, not held in a crystalline macrostructure. It is present as a powder, and is the main constituent of substances such
Thickness (graph theory) Thickness (graph theory) In graph theory, the thickness of a graph is the minimum number of planar graphs into which the edges of can be partitioned. That is, if there exists a collection of planar graphs, all having the same set of vertices, such that the union of these planar graphs is , then the thickness of is at most . In other words, the thickness of a graph is the minimum number of planar subgraphs whose union equals to graph . Thus, a planar graph has thickness 1. Graphs of thickness 2 are called biplanar graphs. The concept of