Results 91 to 100 of about 1,056 (209)
On the bend-number of planar and outerplanar graphs [PDF]
Discrete Applied Mathematics, 2012 appears in proceedings of 10th Latin American Symposium on Theoretical Informatics (LATIN 2012)
Heldt, Daniel +2 more
openaire +3 more sources
Area-Efficient Drawings of Outerplanar Graphs
, 2004 We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn^{1.48}) in O(n) time.
Ashim Garg +3 more
core +1 more source
Simultaneous Graph Embedding with Bends and Circular Arcs
, 2007 We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar ...
Cappos, Justin +3 more
core +1 more source
Crosscap of the non-cyclic graph of groups
AKCE International Journal of Graphs and Combinatorics, 2016 The non-cyclic graph CG to a non locally cyclic group G is as follows: take G∖Cyc(G) as vertex set, where Cyc(G)={x∈G|〈x,y〉 is cyclic for all y∈G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup.
K. Selvakumar, M. Subajini
doaj +1 more source
On the Intersection Graphs Associeted to Posets
Discussiones Mathematicae - General Algebra and Applications, 2020 Let (P, ≤) be a poset with the least element 0. The intersection graph of ideals of P, denoted by G(P), is a graph whose vertices are all nontrivial ideals of P and two distinct vertices I and J are adjacent if and only if I ∩ J ≠ {0}.
Afkhami M. +2 more
doaj +1 more source
Light graphs in families of outerplanar graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Tutte polynomial characterizes simple outerplanar graphs [PDF]
, 2011 We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noy, M. +19 more
core +1 more source
On Separating Path and Tree Systems in Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ...
Ahmad Biniaz +8 more
doaj +1 more source
Upward Planarity Testing of Outerplanar Dags (Extended Abstract)
, 1995 In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acyclic graph (odag) can be drawn upward planar, that is, drawn in planar straight-line fashion so that all arcs point up.
Papakostas, Achilleas +1 more
core +1 more source