How Not to Characterize Planar-emulable Graphs

@inproceedings{Chimani2011HowNT,
  title={How Not to Characterize Planar-emulable Graphs},
  author={Markus Chimani and Martin Derka and Petr Hlinen{\'y} and Matej Klus{\'a}cek},
  booktitle={IWOCA},
  year={2011}
}
We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph)—a problem raised already in Fellows’ thesis (1985) and conceptually related to the better known planar cover conjecture by Negami (1986). For over two decades, the planar emulator problem lived poorly in a shadow of Negami’s conjecture—which is still open—as the two were considered equivalent. But, in the end of 2008, a surprising construction by Rieck and… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Planar Emulators and Planar Covers

  • M. Fellows
  • Unpublished manuscript,
  • 1988
Highly Influential
9 Excerpts

Towards Finite Characterization of Planar-emulable Non-projective Graphs, Congressus Numerantium

  • M. Derka
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…