Results 81 to 90 of about 2,073 (195)
Nullspace Embeddings for Outerplanar Graphs [PDF]
, 2017 21 pages.
Lovász, L., Schrijver, A.
openaire +6 more sources
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
Excluded-minor characterization of apex-outerplanar graphs [PDF]
, 2011 It is well known that the class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K_4 and K_{2,3}. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed.
Dziobiak, Stanislaw +2 more
core +1 more source
Random graphs embeddable in order‐dependent surfaces
Random Structures &Algorithms, Volume 64, Issue 4, Page 940-985, July 2024.Abstract Given a ‘genus function’ g=g(n)$$ g=g(n) $$, we let Eg$$ {\mathcal{E}}^g $$ be the class of all graphs G$$ G $$ such that if G$$ G $$ has order n$$ n $$ (i.e., has n$$ n $$ vertices) then it is embeddable in a surface of Euler genus at most g(n)$$ g(n) $$.
Colin McDiarmid, Sophia Saller
wiley +1 more source
On tree decompositions whose trees are minors
Journal of Graph Theory, Volume 106, Issue 2, Page 296-306, June 2024.Abstract In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$.
Pablo Blanco +5 more
wiley +1 more source
The product structure of squaregraphs
Journal of Graph Theory, Volume 105, Issue 2, Page 179-191, February 2024.Abstract A squaregraph is a plane graph in which each internal face is a 4‐cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semistrong product of an outerplanar graph and a path.
Robert Hickingbotham +3 more
wiley +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
FOG: Finding outerplanar graphs [PDF]
, 2006 In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications.
Schietgat, Leander +3 more
core
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
Every Property of Outerplanar Graphs is Testable [PDF]
, 2016 A D-disc around a vertex v of a graph G=(V,E) is the subgraph induced by all vertices of distance at most D from v. We show that the structure of an outerplanar graph on n vertices is determined, up to modification (insertion or deletion) of at most ...
Newman, Ilan +2 more
core +1 more source