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
Silicon nanowires have received considerable attention as transistor components because they represent a facile route toward sub… 
Highly Cited
2002
Highly Cited
2002
Heterojunction and superlattice formation is essential for many potential applications of semiconductor nanowires in nanoscale… 
Review
2002
Review
2002
We review recent advances in experimental methods for high spatial-resolution and high time-resolution thermometry, and the… 
Highly Cited
2001
Highly Cited
2001
We describe the synthesis of water-soluble semiconductor nanoparticles and discuss and characterize their properties. Hydrophobic… 
Highly Cited
1992
Highly Cited
1992
The dynamics of two-dimensional ordering of micrometer-size polystyrene latex spheres on a horizontal glass substrate has been… 
Highly Cited
1972
Highly Cited
1972
The classical Ramsey numbers [7] involve the occurrence of monochromatic complete subgraphs in line-colored complete graphs. By…