Results 131 to 140 of about 119,166 (199)
On reconstructing maximal outerplanar graphs
Discrete Mathematics, 1974 Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types ...
openaire +2 more sources
Outerplanar graphs with positive Lin-Lu-Yau curvature [PDF]
arXivIn 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$. Furthermore, if $G$ is maximally outerplanar, then $G$ has at most $10$ vertices. Both upper bounds are sharp.
arxiv
The Tutte polynomial characterizes simple outerplanar graphs [PDF]
, 2011 Andrew Goodall +3 more
openalex +1 more source
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
Approximate Realizations for Outerplanaric Degree Sequences [PDF]
arXivWe study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
arxiv
I/O-Optimal Algorithms for Outerplanar Graphs
, 2004 Anil Maheshwari, Norbert Zeh
openalex +1 more source
Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs” [PDF]
, 2012 Jianfeng Hou, Jianliang Wu
openalex +1 more source
The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs [PDF]
, 2013 Francesc Comellas +3 more
openalex +1 more source