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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1997-2015
012319972015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Kelly showed that there exist planar posets of arbitrarily large dimension, and Streib and Trotter showed that the dimension of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We show that for each integer h ≥ 2, there exists a least positive integer ch so that if P is a poset having a planar cover graph… (More)
Is this relevant?
2011
2011
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G → H which… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar… (More)
  • figure 1
  • figure 3
Is this relevant?
2007
2007
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one… (More)
Is this relevant?
2004
2004
A simple graph H is a cover of a graph G if there exists a mapping φ from H onto G such that φ maps the neighbors of every vertex… (More)
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
A graph G has a planar cover if there exists a planar graph H , and a homomorphism φ : H → G that maps the neighbours of each… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
  • Petr Hlin En
  • 1997
A graph G has a planar cover if there exists a planar graph H, and a homo-morphism ' : H ! G that maps the neighbours of each… (More)
Is this relevant?