Survey of planar and outerplanar graphs in fuzzy and neutrosophic graphs
T Fujita, F Smarandache - Advancing Uncertain Combinatorics …, 2024 - books.google.com
As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …
explores networks made up of nodes and edges, focusing on their paths, structures, and …
The density of fan-planar graphs
M Kaufmann, T Ueckerdt - arXiv preprint arXiv:1403.6184, 2014 - arxiv.org
A topological drawing of a graph is fan-planar if for each edge $ e $ the edges crossing $ e $
form a star and no endpoint of $ e $ is enclosed by $ e $ and its crossing edges. A fan …
form a star and no endpoint of $ e $ is enclosed by $ e $ and its crossing edges. A fan …
[HTML][HTML] Fan-planarity: Properties and complexity
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex.
Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt [35], who …
Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt [35], who …
Recognizing optimal 1-planar graphs in linear time
FJ Brandenburg - Algorithmica, 2018 - Springer
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is
crossed at most once, and is optimal if it has the maximum of 4 n-8 4 n-8 edges. We show …
crossed at most once, and is optimal if it has the maximum of 4 n-8 4 n-8 edges. We show …
Min-k-planar Drawings of Graphs
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …
Graphs Drawn with Some Vertices per Face: Density and Relationships
Graph drawing beyond planarity is a research area that has received an increasing attention
in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in …
in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in …
Testing full outer-2-planarity in linear time
SH Hong, H Nagamochi - Graph-Theoretic Concepts in Computer Science …, 2016 - Springer
A graph is 1-planar, if it admits a 1-planar embedding, where each edge has at most one
crossing. Unfortunately, testing the 1-planarity of a graph is known as NP-complete. This …
crossing. Unfortunately, testing the 1-planarity of a graph is known as NP-complete. This …
Planar and quasi-planar simultaneous geometric embedding
A simultaneous geometric embedding (SGE) of two planar graphs and with the same vertex
set is a pair of straight-line planar drawings of and of such that each vertex is drawn at the …
set is a pair of straight-line planar drawings of and of such that each vertex is drawn at the …
Min--planar Drawings of Graphs
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …
[图书][B] Angular Schematization in Graph Drawing
P Kindermann - 2016 - opus.bibliothek.uni-wuerzburg.de
Graphs are a frequently used tool to model relationships among entities. A graph is a binary
relation between objects, that is, it consists of a set of objects (vertices) and a set of pairs of …
relation between objects, that is, it consists of a set of objects (vertices) and a set of pairs of …