Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777093 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
We give a polynomial-time algorithm to decide whether a connected bipartite graph admits a two-layer drawing in the plane such that a specified subset of pairs of disjoint edges cross. We consider the problem of deciding whether there exists such a drawing in which a specified subset of triples of pairwise crossing edges are concurrent. We give a necessary condition for the same and conjecture that it is sufficient.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh,