On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar.
In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given.
KeywordsLinear Time Outer Edge Rotation System Vertical Edge Outer Face
Unable to display preview. Download preview PDF.
- 5.Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. CoRR abs/1409.0461 (September 2014)Google Scholar
- 6.Cheong, O., Har-Peled, S., Kim, H., Kim, H.S.: On the number of edges of fan-crossing free graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 163–173. Springer, Heidelberg (2013)Google Scholar
- 17.Hong, S.H., Nagamochi, H.: Testing full outer-2-planarity in linear time. Technical Report 2014-003, Department of Applied Mathematics and Physics, Kyoto University (2014)Google Scholar
- 18.Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs/1403.6184 (2014)Google Scholar