Results 11 to 20 of about 371,700 (244)

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4 [PDF]

, 2009
A mapping from the vertex set of a graph G=(V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common ...
Noble, Steven, Havet, F, Eggemann, N, Havet, F., Nicole Eggemann, Frédéric Havet, Eggemann, N., Noble, S D, Steven D. Noble   +8 more
core   +6 more sources

2-PROPIONYLTHIOPHENE: PLANAR, OR NOT PLANAR, THAT IS THE QUESTION [PDF]

Proceedings of the 2021 International Symposium on Molecular Spectroscopy, 2020
Non-planarity of 2-propionylthiophene proven by the microwave spectroscopy – quantum chemistry duet.
Dindic, Christina, Stahl, Wolfgang, Nguyen, Ha Vinh Lam   +2 more
openaire   +5 more sources

Fitting Planar Graphs on Planar Maps [PDF]

Journal of Graph Algorithms and Applications, 2014
Graph and cartographic visualization have the common objective to provide intuitive understanding of some underlying data. We consider a problem that combines aspects of both by studying the problem of fitting planar graphs on planar maps. After providing an NP-hardness result for the general decision problem, we identify sufficient conditions so ...
Md. Jawaherul Alam, Michael Kaufmann 0001, Stephen G. Kobourov, Tamara Mchedlidze   +3 more
openaire   +2 more sources

(k, p)-Planarity: A Relaxation of Hybrid Planarity [PDF]

Theoretical Computer Science, 2018
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each cluster is associated with a closed, bounded planar region, called a cluster region; (ii) cluster regions are pairwise ...
Di Giacomo, E, Lenhart, WJ, Liotta, G, Randolph, TW, Tappini, A   +4 more
openaire   +7 more sources

Strip Planarity Testing for Embedded Planar Graphs [PDF]

Algorithmica, 2016
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G(V,E)$ and a function $γ:V \rightarrow \{1,2,\dots,k\}$ and asks whether a planar drawing of $G$ exists such that each edge is monotone in the $y$-direction and, for any $u,v\in V$ with $γ(u)
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati   +3 more
openaire   +5 more sources

Synchronized Planarity with Applications to Constrained Planarity Problems

ACM Transactions on Algorithms, 2023
We introduce the problem S ynchronized P lanarity . Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. S ynchronized P
Thomas Bläsius, Simon D. Fink, Ignaz Rutter   +2 more
openaire   +7 more sources

Planar and Quasi-Planar Simultaneous Geometric Embedding [PDF]

The Computer Journal, 2014
A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have ...
DI GIACOMO, Emilio, DIDIMO, WALTER, LIOTTA, Giuseppe, Meijer, Henk, Wismath, Stephen K.   +4 more
openaire   +3 more sources

Planar gunn diode characterisation and resonators elements to realise oscillator circuits [PDF]

, 2013
The paper describes the planar Gunn diode, which is well suited to providing milli-metric and tera hertz sources using microwave monolithic integrated circuit (MMIC) technologies. Different planar Gunn electrode geometries are described along with DC, RF
A. Stephen, M Kuball, G Dunn, Glover, J., Khalid, A., Oxley, C.H., Li Chong, J. Glover, Cumming, D.R.S., Dunn, G., G. A. Evans, Evans, G.A., Li, C., M Ismaeel Maricar, Ata Khalid, Kuball, M., Montes Bajo, M., Papageorgiou, V., Ismaeel Maricar, M, V Papageorgiou, C H Oxley, D R S Cumming, Stephens, A., M Montes Bajo   +23 more
core   +1 more source

Planar Depth and Planar Subalgebras

Journal of Functional Analysis, 2002
In [Planar algebras. I (preprint math.QA/9909027)] planar algebras were introduced by \textit{V. F. R. Jones} to get insight in the study of subfactors, especially in the algebraic-combinatorial aspects of the lattice of higher relative commutants. To each extremal type \(II_1\) finite index subfactor inclusion, Jones has associated a spherical \(C^*\)-
Landau, Zeph, Sunder, V.S
openaire   +1 more source

Computing Planarity in Computable Planar Graphs

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire   +3 more sources