Results 21 to 30 of about 147,831 (333)
Planar Projections of Graphs [PDF]
Discrete Applied Mathematics, 2020 We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices has a representation in $\lceil \sqrt{n/2}+1 \rceil$ planes.
N.R. Aravind, Udit Maniyar
openaire +6 more sources
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 +2 more sources
Note on robust coloring of planar graphs [PDF]
Opuscula MathematicaWe consider the robust chromatic number \(\chi_1(G)\) of planar graphs \(G\) and show that there exists an infinite family of planar graphs \(G\) with \(\chi_1(G) = 3\), thus solving a recent problem of Bacsó et al.
František Kardoš +2 more
doaj +1 more source
Structural properties of 1-planar graphs and an application to acyclic edge coloring [PDF]
, 2010 A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small vertices (i.e ...
Liu, Guizhen, Wu, Jian-Liang, Zhang, Xin
core +1 more source
Journal of Combinatorial Theory, Series B, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire +4 more sources
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
On the Fiedler value of large planar graphs [PDF]
, 2013 The Fiedler value $\lambda_2$, also known as algebraic connectivity, is the second smallest Laplacian eigenvalue of a graph. We study the maximum Fiedler value among all planar graphs $G$ with $n$ vertices, denoted by $\lambda_{2\max}$, and we show the ...
Alon +25 more
core +4 more sources
, 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 ...
Goudar, Venkanagouda, Prasad, Manjunath
core +2 more sources
Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles [PDF]
Rendiconti di Matematica e delle Sue Applicazioni, 2023 In this paper, a new family of rotationally symmetric planar graphs is described based on an edge coalescence of planar chorded cycles. Their local fractional metric dimension is established for those ones arisen from chorded cycles of order up to six ...
Shahbaz Ali +2 more
doaj
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