Další formáty:
BibTeX
LaTeX
RIS
@misc{912937, author = {Hliněný, Petr}, booktitle = {Workshop on Graph Covers (ATCAGC 2009), Finse, Norsko}, keywords = {planar covers; projective embedding}, language = {eng}, note = {Invited talk.}, title = {21 years of Negami's planar cover conjecture}, year = {2009} }
TY - SLIDE ID - 912937 AU - Hliněný, Petr PY - 2009 TI - 21 years of Negami's planar cover conjecture N1 - Invited talk. KW - planar covers KW - projective embedding N2 - In 1988, Seiya Negami published a conjecture stating that a graph $G$ has a finite planar cover (i.e.~a homomorphism from some planar graph onto $G$ which maps the vertex neighbourhoods bijectively) if and only if $G$ embeds in the projective plane. Though the "if" direction is easy, and some supporting weaker statements have been shown by him, the conjecture is still open, after more than 20 years of intensive investigation. We review the (quite significant) progress made so far in solving Negami's conjecture, and propose possible promising directions of future research. ER -
HLINĚNÝ, Petr. 21 years of Negami's planar cover conjecture. In \textit{Workshop on Graph Covers (ATCAGC 2009), Finse, Norsko}. 2009.
|