Results 21 to 30 of about 1,566,979 (286)
Every Planar Map Is Four Colorable
Mathematical Solitaires & Games, 2019 As has become standard, the four color map problem will be considered in the dual sense as the problem of whether the vertices of every planar graph (without loops) can be colored with at most four colors in such a way that no pair of vertices which lie ...
K. Appel, W. Haken
semanticscholar +1 more source
Italian National Conference on Sensors, 2021 Recent developments in the field of microwave planar sensors have led to a renewed interest in industrial, chemical, biological and medical applications that are capable of performing real-time and non-invasive measurement of material properties.
R. Alahnomi +6 more
semanticscholar +1 more source
Journal of Combinatorial Theory, Series A, 2018 The error in the differentiation argument has been ...
Simeon Ball, Michel Lavrauw
openaire +5 more sources
Enhanced photovoltage for inverted planar heterojunction perovskite solar cells
Science, 2018 Perovskite layers make the grade Inverted planar perovskite solar cells offer opportunities for a simplified device structure compared with conventional mesoporous titanium oxide interlayers.
Deying Luo +23 more
semanticscholar +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 ...
Goudar, Venkanagouda, Prasad, Manjunath
core +2 more sources
A correspondence between rooted planar maps and normal planar lambda terms [PDF]
, 2015 A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no beta-redexes ...
Giorgetti, Alain, Zeilberger, Noam
core +5 more sources
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 +3 more sources
Improved Distributed Algorithms for Exact Shortest Paths
, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
, 2018 We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier +13 more
core +1 more source