Results 11 to 20 of about 2,427,282 (299)
Splitting Plane Graphs to Outerplanarity
Journal of Graph Algorithms and Applications, 2023 Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for which the problem is NP-hard.Here we study how to minimize the number of splits to turn a plane graph ...
Gronemann, Martin +2 more
openaire +2 more sources
Folding Equilateral Plane Graphs [PDF]
International Journal of Computational Geometry & Applications, 2011 We consider two types of folding applied to equilateral plane graph linkages. First, under continuous folding motions, we show how to reconfigure any linear equilateral tree (lying on a line) into a canonical configuration. By contrast, it is known that such reconfiguration is not always possible for linear (nonequilateral) trees and for (nonlinear ...
Abel, Zachary Ryan +6 more
openaire +5 more sources
Site percolation and isoperimetric inequalities for plane graphs [PDF]
Random Struct. Algorithms, 2019 We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions.
J. Haslegrave, C. Panagiotis
semanticscholar +1 more source
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Affine Graphs and their Topological Indices
Journal of Mathematics, 2021 Graphs are essential tools to illustrate relationships in given datasets visually. Therefore, generating graphs from another concept is very useful to understand it comprehensively. This paper will introduce a new yet simple method to obtain a graph from
Abdurrahman Dayioglu
doaj +1 more source
Edge Partitions of Optimal 2-plane and 3-plane Graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2018 A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a graph with a ...
M. Bekos +5 more
semanticscholar +1 more source
Counting Plane Graphs: Cross-Graph Charging Schemes [PDF]
Combinatorics, Probability and Computing, 2013 We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have recently been used to obtain various properties of triangulations that are embedded in a fixed set of points in the plane.
Sharir, Micha, Sheffer, Adam
openaire +4 more sources
Looseness of Plane Graphs [PDF]
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czap, Július +3 more
openaire +3 more sources
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs [PDF]
International Symposium Graph Drawing and Network Visualization, 2018 An ortho-polygon visibility representation \(\varGamma \) of a 1-plane graph G (OPVR of G) is an embedding preserving drawing that maps each vertex of G to a distinct orthogonal polygon and each edge of G to a vertical or horizontal visibility between ...
G. Liotta +2 more
semanticscholar +1 more source
Zig-zag facial total-coloring of plane graphs [PDF]
Opuscula Mathematica, 2018 In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring.
Július Czap +2 more
doaj +1 more source