Results 21 to 30 of about 1,410,460 (300)
On embedding a cycle in a plane graph [PDF]
Discrete Mathematics, 2006 The problem of drawing a non-simple cycle as a non-intersecting closed curve into a planar graph drawn in the plane with the vertices represented as circles and the edges represented as thin stripes is considered. The problem is shown to have an interpretation in the \textit{clustered planarity}.
Pier Francesco Cortese +3 more
openaire +5 more sources
The nonsolvability by radicals of generic 3-connected planar Laman graphs. [PDF]
, 2007 We show that planar embeddable -connected Laman graphs are generically non-soluble. A Laman graph represents a configuration of points on the Euclidean plane with just enough distance specifications between them to ensure rigidity.
Power, Stephen C., Owen, J. C.
core +2 more sources
Ars Mathematica Contemporanea, 2015 Summary: A plane graph is called alternating if all adjacent vertices have different degrees, and all neighboring faces as well. Alternating plane graphs were introduced in 2008. This paper presents the previous research on alternating plane graphs.{ }There are two smallest alternating plane graphs, having 17 vertices and 17 faces each.
Ingo Althöfer +4 more
openaire +4 more sources
The Neumann problem in graph Lipschitz domain in the plane
, 2022 We study new aspects of the solvability of the classical Neumann boundary value problem in a graph Lipschitz domain in the plane. When the domain is the upper half-plane, the boundary data is assumed to belong to weighted Lebesgue or weighted Lorentz ...
Ortiz Caraballo, Carmen +5 more
core +1 more source
Counting Plane Graphs: Cross-Graph Charging Schemes [PDF]
, 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.
Adam Sheffer +3 more
core +1 more source
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source
Box-Rectangular Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular drawing of a plane graph, every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line ...
Md. Manzurul Hasan +2 more
doaj +1 more source
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
Graphic Representation of a Dimensional Expansion of Triangular Fuzzy Number
Journal of Mathematics, 2021 We calculate Zadeh’s max-min composition operators for two 3-dimensional triangular fuzzy numbers. We prove that if the 3-dimensional result is limited to 2 dimensions, it is the same as the 2-dimensional result, which is shown as a graph.
Yong Sik Yun
doaj +1 more source
Plane Graphs with Parity Constraints [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oswin Aichholzer +6 more
openaire +4 more sources