Results 21 to 30 of about 30,269 (267)
Planar L-Drawings of Bimodal Graphs
Journal of Graph Algorithms and Applications, 2022 In a planar L-drawing of a directed graph (digraph) each edge $e$ is represented as a polyline composed of a vertical segment starting at the tail of $e$ and a horizontal segment ending at the head of $e$. Distinct edges may overlap, but not cross.
Patrizio Angelini +3 more
doaj +1 more source
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal of Graph Algorithms and Applications, 2009 A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim, Md. Saidur Rahman
doaj +1 more source
Connectivity of Planar Graphs [PDF]
Journal of Graph Algorithms and Applications, 2001 We give here three simple linear time algorithms on planar graphs: a 4-connexity test for maximal planar graphs, an algorithm enumerating the triangles and a 3-connexity test. Although all these problems got already linear-time solutions, the presented algorithms are both simple and efficient. They are based on some new theoretical results.
de Fraysseix, Hubert +1 more
openaire +3 more sources
Drawing Partially Embedded and Simultaneously Planar Graphs
Journal of Graph Algorithms and Applications, 2015 We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem-to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph-and the simultaneous ...
Timothy Chan +5 more
doaj +1 more source
Fitting Planar Graphs on Planar Maps [PDF]
Journal of Graph Algorithms and Applications, 2014 Graph and cartographic visualization have the common objective to provide intuitive understanding of some underlying data. We consider a problem that combines aspects of both by studying the problem of fitting planar graphs on planar maps. After providing an NP-hardness result for the general decision problem, we identify sufficient conditions so ...
Md. Jawaherul Alam +3 more
openaire +2 more sources
Planar Octilinear Drawings with One Bend Per Edge
Journal of Graph Algorithms and Applications, 2015 In octilinear drawings of planar graphs, every edge is drawn as a sequence of horizontal, vertical and diagonal (45°) line segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge.
Michael Bekos +3 more
doaj +1 more source
On Longest Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A planar 3-connected graph G is essentially 4-connected if, for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex.
Fabrici Igor +2 more
doaj +1 more source
Computational Study on a PTAS for Planar Dominating Set Problem
Algorithms, 2013 The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time ...
Qian-Ping Gu, Marjan Marzban
doaj +1 more source
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
Axioms, 2023 An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable.
Danjun Huang, Xianxi Wu
doaj +1 more source
The Electronic Journal of Combinatorics, 2018 A nonplanar graph $G$ is called almost-planar if for every edge $e$ of $G$, at least one of $G\backslash e$ and $G/e$ is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published.
Guoli Ding +2 more
openaire +4 more sources