Skip to search formSkip to main contentSkip to account menu

Thickness (graph theory)

Known as: Biplanar graph, Graph thickness, Thickness 
In graph theory, the thickness of a graph G is the minimum number of planar graphs into which the edges of G can be partitioned. That is, if there… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Improving the power conversion efficiency of polymer-based bulk-heterojunction solar cells is a critical issue. Here, we show… 
Review
2011
Review
2011
Hydrogen produced from water and renewable energy could fuel a large fleet of proton-exchange-fuel-cell vehicles in the future… 
Highly Cited
2006
Highly Cited
2006
Polymer-based photovoltaic cells have been fabricated by inserting a thin, transparent, transition metal oxide layer between the… 
Highly Cited
2006
Highly Cited
2006
Purpose – This paper seeks to investigate the possibility of producing medical or dental parts by selective laser melting (SLM… 
Highly Cited
2003
Highly Cited
2003
Growth of (0001) facet-dominated, free-standing, piezoelectric zinc oxide (ZnO) nanostructures is challenged by the divergence of… 
Highly Cited
2001
Highly Cited
2001
We describe the synthesis of water-soluble semiconductor nanoparticles and discuss and characterize their properties. Hydrophobic… 
Highly Cited
1997
Highly Cited
1997
Quantum-mechanical modeling of electron tunneling current from the quantized inversion layer of ultra-thin-oxide (<40 /spl Aring… 
Highly Cited
1972
Highly Cited
1972
The classical Ramsey numbers [7] involve the occurrence of monochromatic complete subgraphs in line-colored complete graphs. By…