Results 91 to 100 of about 584,165 (157)
Column planarity and partially-simultaneous geometric embedding
Journal of Graph Algorithms and Applications, 2017 We introduce the notion of column planarity of a subset $R$ of the vertices of a graph $G$. Informally, we say that $R$ is column planar in $G$ if we can assign $x$-coordinates to the vertices in $R$ such that any assignment of $y$-coordinates to ...
Luis Barba +5 more
doaj +1 more source
A note on zero-divisor graph of amalgamated duplication of a ring along an ideal
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a commutative ring and be a non-zero ideal of . Let be the subring of consisting of the elements for and . In this paper we characterize all isomorphism classes of finite commutative rings with identity and ideal such that is planar.
A. Mallika, R. Kala
doaj +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
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
A refinement operator for outerplanar graphs
, 2022 S.95-97Outerplanar graphs form a practically relevant class of graphs which appear efficiently computable bottom-up refinement operator for tenuous outerplanar graphs defined by combining techniques from first-order learning, algebraic graph theory, and ...
Horvath, Tamas +2 more
core
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
, 2020 We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding and if it does not.
Fabrizio Frati
core +1 more source
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Proximity Drawings of Outerplanar Graphs
, 1997 A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart.
LIOTTA, Giuseppe, W. Lenhart
core
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings [PDF]
, 2016 In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas, and a new method of splitting maximal outerplanar graphs into systems of umbrellas. By doing
Demontigny, Philippe
core