Skip to search formSkip to main contentSkip to account menu

Planar cover

Known as: Negami's conjecture 
In graph theory, a planar cover of a finite graph G is a finite covering graph of G that is itself a planar graph. Every graph that can be embedded… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • Bartosz Walczak
  • Journal of combinatorial theory. Series B (Print)
  • 2017
  • Corpus ID: 8910722
2016
2016
A finite-difference time-domain (FDTD) method for simulating wave propagation in Havriliak-Negami (HN) dispersive media is… 
2016
2016
The dielectric properties of silanized-Si/epoxy nanocomposites have been studied. Two types of silanizing agents were employed… 
2014
2014
A thin film of pyroelectric composite with 0–3 connectivity was fabricated from zinc oxide (ZnO) nanopowder and polyvinylidene… 
2013
2013
Saving energy in buildings is of great importance because about 30 to 40 % of the energy in the world is used in buildings. An… 
2010
2010
We derive a general pattern of the nonexponential, two-power-law relaxation from the compound subordination theory of random… 
Review
2010
Review
2010
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some… 
Highly Cited
2002
Highly Cited
2002
In this paper a novel way to quantify “nonexponential” relaxations is described. So far, this has been done in two ways: (1) by… 
2002
2002
A novel fitting function for the complex frequency-dependent dielectric susceptibility is introduced and compared against other… 
2001
2001
A graph H is a cover of a graph G if there exists a mapping φ from V(H) onto V(G) such that φ maps the neighbors of every vertex…