Results 81 to 90 of about 1,056 (209)
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
Choosability with separation of cycles and outerplanar graphs
Discussiones Mathematicae Graph Theory, 2023 We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|\le a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G ...
Togni, Olivier, Godin, Jean-Christophe
openaire +4 more sources
How to Draw Outerplanar Minimum Weight Triangulations
, 1996 In this paper we consider the problem of characterizing those graphs that can be drawn as minimum weight triangulations and answer the question for maximal outerplanar graphs.
Lenhart, William J., Liotta, Giuseppe
core +1 more source
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Special Matrices, 2014 The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour +2 more
doaj +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
Four-searchable biconnected outerplanar graphs
Discrete Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diner, Oznur Yasar +3 more
openaire +1 more source
Structure and properties of maximal outerplanar graphs.
, 2009 Outerplanar graphs are planar graphs that have a plane embedding in which each vertex lies on the boundary of the exterior region. An outerplanar graph is maximal outerplanar if the graph obtained by adding an edge is not outerplanar. Maximal outerplanar
Allgeier, Benjamin
core +1 more source
A note on zero-divisor graph of amalgamated duplication of a ring along an ideal
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a commutative ring and be a non-zero ideal of . Let be the subring of consisting of the elements for and . In this paper we characterize all isomorphism classes of finite commutative rings with identity and ideal such that is planar.
A. Mallika, R. Kala
doaj +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
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph [PDF]
Graphs and Combinatorics, 2017 Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related result, Chartran and Kronk, proved that the vertices of every planar graph can be partitioned into three sets ...
Glencora Borradaile +2 more
openaire +2 more sources