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)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Stefan Felsner, William T. Trotter, Veit Wiechert
- Graphs and Combinatorics
- 2015

Kelly showed that there exist planar posets of arbitrarily large dimension, and Streib and Trotter showed that the dimension of aâ€¦Â (More)

Is this relevant?

2011

2011

- Noah Streib, William T. Trotter
- Electronic Notes in Discrete Mathematics
- 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)

Is this relevant?

Review

2010

Review

2010

- Petr HlinenÃ½
- Graphs and Combinatorics
- 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)

Is this relevant?

2010

2010

- Yo'av Rieck, Yasushi Yamashita
- Eur. J. Comb.
- 2010

In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planarâ€¦Â (More)

Is this relevant?

2007

2007

- M. J. Dunwoody
- 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

- Petr HlinenÃ½, Robin Thomas
- Journal of Graph Theory
- 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

- Petr HlinenÃ½
- Journal of Graph Theory
- 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)

Is this relevant?

1998

1998

- Petr HlineÃ½
- Journal of Graph Theory
- 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)

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?