0
$\begingroup$

Let $G$ be a graph which is rigid and non-planar (e.g. $K_{3,3}$). Is it possible that $G$ has a planar cover?

Are there any studies on this topic?

$\endgroup$
  • 2
    $\begingroup$ The question has little do with computer science, and should thus be asked on Mathematics. $\endgroup$ – Juho Nov 13 '16 at 10:06
  • $\begingroup$ @Juho I thought we had consensus that graph-theory was ontopic? $\endgroup$ – Raphael Nov 13 '16 at 10:16
  • $\begingroup$ That said, the question is quite thin. What have you tried and where did you get stuck? Which research did you do? $\endgroup$ – Raphael Nov 13 '16 at 10:16
  • $\begingroup$ @Raphael There seems to be a lot of cross-over between graph theory and CS but this question doesn't have any computational content, so it seems hard to justify it being on-topic here. $\endgroup$ – David Richerby Nov 13 '16 at 18:28

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.