Abstract
We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph)—a problem raised 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 Yamashita falsified the natural “planar emulator conjecture”, and thus opened a whole new research field. We present further results and constructions which show how far the planar-emulability concept is from planar-coverability, and that the traditional idea of likening it to projective embeddability is actually very out-of-place. We also present several positive partial characterizations of planar-emulable graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archdeacon, D.: A Kuratowski Theorem for the Projective Plane. J. Graph Theory 5, 243–246 (1981)
Chimani, M., Derka, M., Hliněný, P., Klusáček, M.: How Not to Characterize Planar-emulable Graphs. ArXiv e-prints 1107.0176, http://arxiv.org/abs/1107.0176
Derka, M.: Planar Graph Emulators: Fellows’ Conjecture. Bc. Thesis, Masaryk University, Brno (2010), http://is.muni.cz/th/255724/fi_b/thesis.pdf
Derka, M.: Towards Finite Characterization of Planar-emulable Non-projective Graphs. Congressus Numerantium, 207–211 (submitted, 2011)
Fellows, M.: Encoding Graphs in Graphs. Ph.D. Dissertation, Univ. of California, San Diego (1985)
Fellows, M.: Planar Emulators and Planar Covers (1988) (unpublished manuscript)
Glover, H., Huneke, J.P., Wang, C.S.: 103 Graphs That Are Irreducible for the Projective Plane. J. of Comb. Theory Ser. B 27, 332–370 (1979)
Hliněný, P.: K 4,4 − e Has No Finite Planar Cover. J. Graph Theory 27, 51–60 (1998)
Hliněný, P.: Planar Covers of Graphs: Negami’s Conjecture. Ph.D. Dissertation, Georgia Institute of Technology, Atlanta (1999)
Hliněný, P.: Another Two Graphs Having no Planar Covers. J. Graph Theory 37, 227–242 (2001)
Hliněný, P.: 20 Years of Negami’s Planar Cover Conjecture. Graphs and Combinatorics 26, 525–536 (2010)
Hliněný, P., Thomas, R.: On possible counterexamples to Negami’s planar cover conjecture. J. of Graph Theory 46, 183–206 (2004)
Huneke, J.P.: A Conjecture in Topological Graph Theory. In: Robertson, N., Seymour, P.D. (eds.) Graph Structure Theory. Contemporary Mathematics, Seattle, WA, vol. 147, pp. 387–389 (1991/1993)
Johnson, T., Thomas, R.: Generating Internally Four-Connected Graphs. J. Combin. Theory Ser. B 85, 21–58 (2002)
Klusáček, M.: Construction of planar emulators of graphs. Bc. Thesis, Masaryk University, Brno (2011), http://is.muni.cz/th/324101/fi_b/bc_thesis.pdf
Negami, S.: Enumeration of Projective-planar Embeddings of Graphs. Discrete Math. 62, 299–306 (1986)
Negami, S.: The Spherical Genus and Virtually Planar Graphs. Discrete Math. 70, 159–168 (1988)
Negami, S.: Graphs Which Have No Finite Planar Covering. Bull. of the Inst. of Math. Academia Sinica 16, 378–384 (1988)
Rieck, Y., Yamashita, Y.: Finite planar emulators for K 4,5 − 4K 2 and K 1,2,2,2 and Fellows’ Conjecture. European Journal of Combinatorics 31, 903–907 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chimani, M., Derka, M., Hliněný, P., Klusáček, M. (2011). How Not to Characterize Planar-Emulable Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25011-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-25011-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25010-1
Online ISBN: 978-3-642-25011-8
eBook Packages: Computer ScienceComputer Science (R0)