. "20 years of Negami's planar cover conjecture"@en . . . . . "1"^^ . . "14330" . . . "12"^^ . "20 years of Negami's planar cover conjecture" . "10.1007/s00373-010-0934-9" . . "20 years of Negami's planar cover conjecture"@en . "000279129400007" . "RIV/00216224:14330/10:00049900!RIV12-GA0-14330___" . . "[23BA51523D0A]" . . "P(GA201/08/0308), Z(MSM0021622419)" . "Hlin\u011Bn\u00FD, Petr" . . . "planar covers; projective embedding"@en . "RIV/00216224:14330/10:00049900" . "0911-0119" . "4" . . "20 years of Negami's planar cover conjecture" . "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 %22if%22 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."@en . "JP - Japonsko" . "1"^^ . . "Graphs and Combinatorics" . "26" . "300901" . "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 %22if%22 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." . .