Two graphs without planar covers

Journal of Graph Theory

Volumn 41, Issue 4, 2002, Pages 318-326

  Archdeacon, Dan ^a  

^a University of Vermont ^*  (United States)

Author keywords

Negami's conjecture; Planar cover; Projective plane

Indexed keywords

EID: 0036904483     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10075     Document Type: Article

References (9)

1. 1 D. Archdeacon, A Kuratowski theorem for the projective plane, J Graph Theory 5 ( 1981), 243–246.
2. 2 H. Glover, J. P. Huneke, and C. S. Wang, 103 graphs that are irreducible for the projective plane, J Combin Theory Ser B 27 ( 1979), 332–370.
3. 3 P. Hliněny, Planar covers of graphs: Negami's conjecture, Ph.D. Dissertation, Georgia Institute of Technology, 1999.
4. 4 P. Hliněny, K 4,4 ‐ e has no finite planar cover, J Graph Theory 27 ( 1998), 51–60.
5. 5 P. Hliněny, Another two graphs with no planar covers, J Graph Theory 37 ( 2001) no. 4 227–242.
6. 6 P. Hliněny and R. Thomas, On possible counterexamples to Negami's planar cover conjecture, manuscript, 1999.
7. 7 J. P. Huneke, A conjecture in topological graph theory, Contemp Math 147 ( 1993), 386–387.
8. 8 S. Negami, Graphs which have no finite planar covering, Bull of the Inst of Math Academia Sinica 16 ( 1988), 378–384.
9. 9 S. Negami, The spherical genus and virtually planar graphs, Discrete Math 70 ( 1988), 159–168.