Results 11 to 20 of about 2,073 (195)
Counting outerplanar maps [PDF]
The Electronic Journal of Combinatorics, 2017 A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths.
Geffner, I., Noy Serrano, Marcos
core +3 more sources
The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
Journal of Mathematics, 2022 A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix AD is nonsingular (singular).
Borui He, Xianya Geng, Long Wang
doaj +2 more sources
Outerplanar and Forest Storyplans
Computing in Geometry and TopologyWe 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 storyplan, and each drawing in the sequence is called a frame.
Jiří Fiala +4 more
doaj +4 more sources
Monitoring maximal outerplanar graphs [PDF]
Electronic Notes in Discrete Mathematics, 2014 In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar ...
Martins, Mafalda +3 more
core +7 more sources
On the orthogonal drawing of outerplanar graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004 . In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles.
Shuichi Ueno +2 more
core +2 more sources
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Streinu, Ileana +5 more
core +6 more sources
Outerplanar Obstructions for Matroid Pathwidth
Electronic Notes in Discrete Mathematics, 2011 For each k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most k. Our proof combines a decomposition lemma for proving lower bounds on matroid pathwidth and a relation between matroid pathwidth and ...
Koutsonas, A. +2 more
core +7 more sources
Pathlength of Outerplanar Graphs
Theoretical Computer Science, 2022 A path-decomposition of a graph G = (V, E) is a sequence of subsets of V , called bags, that satisfy some connectivity properties. The length of a path-decomposition of a graph G is the greatest distance between two vertices that belong to a same bag and the pathlength, denoted by pl(G), of G is the smallest length of its path-decompositions.
Dissaux, Thomas, Nisse, Nicolas
openaire +6 more sources
Outerplanar and Planar Oriented Cliques [PDF]
Journal of Graph Theory, 2015 AbstractThe clique number of an undirected graph G is the maximum order of a complete subgraph of G and is a well‐known lower bound for the chromatic number of G. Every proper k‐coloring of G may be viewed as a homomorphism (an edge‐preserving vertex mapping) of G to the complete graph of order k.
Sopena, Eric, Sen, Sagnik, Nandy, Ayan
openaire +3 more sources
Outerplanar partial cubes [PDF]
, 2022 Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Kolja Knauer[en] The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: ${\mathbf{}}K_{4}$ and $K_{
Rovira Segú, Bernat
core +5 more sources