Results 121 to 130 of about 30,213,529 (145)
Some of the next articles are maybe not open access.
Fáry’s Theorem for 1-Planar Graphs
2012A plane graph is a graph embedded in a plane without edge crossings. Fary’s theorem states that every plane graph can be drawn as a straight-line drawing, preserving the embedding of the plane graph. In this paper, we extend Fary’s theorem to a class of non-planar graphs.
Seok-Hee Hong 0001 +3 more
openaire +2 more sources
The Matching Extendability of Optimal 1-Planar Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Fujisawa +2 more
openaire +2 more sources
The 6-degeneracy of 1-planar graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qingqin Wu +2 more
openaire +1 more source
Algorithms for 1-Planar Graphs
2020A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It is known that testing 1-planarity of a graph is NP-complete. This chapter reviews the algorithmic results on 1-planar graphs. We first review a linear time algorithm for testing maximal 1-planarity of a graph if a rotation system (i.e., the circular ...
openaire +1 more source
Planar graphs that need four pages
Journal of Combinatorial Theory Series B, 2020Mihalis Yannakakis
exaly
Further results on random cubic planar graphs
Random Structures and Algorithms, 2020Marc Noy, Juanjo Rue
exaly
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM, 2021Louis Espéret +2 more
exaly

