DeVos–Mohar–Samal conjecture on crossing-free drawings of disconnected graphs
Let be the disjoint union of two connected graphs and , and let be a surface. An optimal drawing of on is a drawing whose crossing number equals the crossing number of on .
DeVos–Mohar–Samal conjecture. For every optimal drawing of on , the restrictions to and do not intersect.
This conjecture concerns whether the connected components of a disconnected graph can always be drawn separately in an optimal drawing on any surface. Its status is not resolved by the supplied source context.
References
Primary source
Laurent Beaudou, Antoine Gerbaud, Roland Grappe and Frederic Palesi, “Drawing disconnected graphs on the Klein bottle”, arXiv:0810.0508 (2008).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.