Results 31 to 40 of about 27,053 (309)
Intuitionistic Fuzzy Planar Graphs
Discrete Dynamics in Nature and Society, 2014 Graph theory has numerous applications in modern sciences and technology. Atanassov introduced the concept of intuitionistic fuzzy sets as a generalization of fuzzy sets. Intuitionistic fuzzy set has shown advantages in handling vagueness and uncertainty
Noura Alshehri, Muhammad Akram
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 +3 more sources
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
On Weak Flexibility in Planar Graphs
, 2020 Recently, Dvo\v{r}\'ak, Norin, and Postle introduced flexibility as an extension of list coloring on graphs [JGT 19']. In this new setting, each vertex $v$ in some subset of $V(G)$ has a request for a certain color $r(v)$ in its list of colors $L(v ...
Murphy, Kyle +3 more
core +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
NP-Completeness Results for Minimum Planar Spanners [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 For any fixed parameter t greater or equal to 1, a t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G.
Ulrik Brandes, Dagmar Handke
doaj +2 more sources
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
Planar Graphs under Pythagorean Fuzzy Environment
Mathematics, 2018 Graph theory plays a substantial role in structuring and designing many problems. A number of structural designs with crossings can be found in real world scenarios. To model the vagueness and uncertainty in graphical network problems, many extensions of
Muhammad Akram +2 more
doaj +1 more source
Four pages are indeed necessary for planar graphs
Journal of Computational Geometry, 2020 An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum
Michael Kaufmann +5 more
doaj +1 more source