Results 31 to 40 of about 1,769 (162)
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
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
, 2018 Has appeared in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)
Steven Chaplick +4 more
openaire +3 more sources
Small Area Drawings of Outerplanar Graphs [PDF]
, 2006 We show three linear time algorithms for constructing planar straight-line grid drawings of outerplanar graphs. The first and the second algorithm are for balanced outerplanar graphs. Both require linear area. The drawings produced by the first algorithm
Frati, Fabrizio +3 more
core +1 more source
A Note on Edge‐Group Choosability of Planar Graphs without 5‐Cycles
Journal of Mathematics, Volume 2020, Issue 1, 2020., 2020 This paper is devoted to a study of the concept of edge‐group choosability of graphs. We say that G is edge‐k‐group choosable if its line graph is k‐group choosable. In this paper, we study an edge‐group choosability version of Vizing conjecture for planar graphs without 5‐cycles and for planar graphs without noninduced 5‐cycles (2010 Mathematics ...
Amir Khamseh, Andrei V. Kelarev
wiley +1 more source
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
Free Choosability of Outerplanar Graphs [PDF]
Graphs and Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aubry, Yves +2 more
openaire +3 more sources
I/O-Optimal Algorithms for Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2004 We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing an ϵ-separator of size O(1/ϵ) take O(scan(N))
Anil Maheshwari, Norbert Zeh
doaj +1 more source
Location in maximal outerplanar graphs [PDF]
, 2017 In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the
Hernando Martín, María del Carmen +6 more
core +1 more source
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