Results 41 to 50 of about 2,073 (195)
A generalization of outerplanar graphs
Discrete Mathematics, 1984 A graph G is said to be W-outerplanar if it can be embedded in the plane so that all vertices of a given set \(W\subset V(G)\) lie on the boundary of one face. A characterization of such graphs is given by means of forbidden subgraphs, and an algorithm for W-outerplanarity testing is described. The results overlap, in part, with those of \textit{V.
Lía Oubiña, R. Zucchello
openaire +3 more sources
A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs
مجلة بغداد للعلوم, 2023 Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)
BIBIN K JOSE
doaj +1 more source
A linear algorithm to recognize maximal generalized outerplanar graphs [PDF]
, 1997 summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs).
Márquez Pérez, Alberto +4 more
core +1 more source
A generalization of outerplanar graphs [PDF]
Časopis pro pěstování matematiky, 1988 A planar graph is said to be a generalized outerplanar graph if it has an embedding in the plane in which every edge is incident to a vertex laying on the boundary of the outer face. The author presents a characterization of generalized outerplanar graphs by means of a set of exactly 12 forbidden subgraphs (up to homeomorphism).
openaire +1 more source
On the Order Dimension of Outerplanar Maps [PDF]
Order, 2010 Schnyder characterized planar graphs in terms of order dimension. Brightwell and Trotter proved that the dimension of the vertex-edge-face poset $\Pvef{M}$ of a planar map $M$ is at most four. In this paper we investigate cases where $\dim(\Pvef{M}) \leq 3$ and also where $\dim(\Qvf{M}) \leq 3$; here $\Qvf{M}$ denotes the vertex-face poset of $M$.
Felsner, Stefan, Nilsson, Johan
openaire +3 more sources
Nilpotent graphs with crosscap at most two
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a commutative ring with identity. The nilpotent graph of , denoted by , is a graph with vertex set , and two vertices and are adjacent if and only if is nilpotent, where .
A. Mallika, R. Kala
doaj +1 more source
Genus Distributions of Cubic Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2011 We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders ...
Jonathan Gross
doaj +1 more source
Outerplanar and Forest Storyplans [PDF]
, 2023 We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{frame ...
Zink, Johannes +4 more
core
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
Journal of Graph Algorithms and Applications, 2005 In this article we define a canonical decomposition of rooted outerplanar maps into a spanning tree and a list of edges. This decomposition, constructible in linear time in the Word-RAM model, implies the existence of bijection between rooted ...
Nicolas Bonichon +2 more
doaj +1 more source
Outerplanar graphs with positive Lin–Lu–Yau curvature [PDF]
In this paper, we show that all simple outerplanar graphs G with minimum degree at least 2 and positive Lin–Lu–Yau Ricci curvature on every edge have maximum degree at most 9.
Yu, Jing +4 more
core +3 more sources