Mathematics – Combinatorics
Scientific paper
2008-12-19
European Journal of Combinatorics 31 (2010) 903
Mathematics
Combinatorics
Final version. To appear in European Journal of Combinatorics
Scientific paper
10.1016/j.ejc.2009.06.003
In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar cover. We construct a finite planar emulator for K_{4,5} - 4K_2. Archdeacon showed that K_{4,5} - 4K_2 does not admit a finite planar cover; thus K_{4,5} - 4K_2 provides a counterexample to Fellows' Conjecture. It is known that Negami's Planar Cover Conjecture is true if and only if K_{1,2,2,2} admits no finite planar cover. We construct a finite planar emulator for K_{1,2,2,2}. The existence of a finite planar cover for K_{1,2,2,2} is still open.
Rieck Yo'av
Yamashita Yasushi
No associations
LandOfFree
Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726720