Results 121 to 130 of about 119,166 (199)
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Total coloring of pseudo-outerplanar graphs [PDF]
arXiv, 2011 A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the total coloring conjecture is completely confirmed for pseudo-outerplanar graphs. In particular, it is proved that
arxiv
A study of upper ideal relation graphs of rings
AKCE International Journal of Graphs and CombinatoricsLet R be a ring with unity. The upper ideal relation graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all non-unit elements of R and two distinct vertices x, y are adjacent if and only if there exists ...
Barkha Baloda +2 more
doaj +1 more source
Small Area Drawings of Outerplanar Graphs [PDF]
, 2006 Giuseppe Di Battista, Fabrizio Frati
openalex +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Improved Outerplanarity Bounds for Planar Graphs [PDF]
arXivIn this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface vertices until the graph is empty. It is well-known that there are $n$-vertex graphs with outerplanarity $\tfrac{n}{6}+\Theta(1)$, and not difficult to show that the ...
arxiv
Algebraic characterizations of outerplanar and planar graphs
European Journal of Combinatorics, 2007 AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani’s theorem characterizes planar graphs as those graphs that have an even drawing. In this paper we present an algebraic characterization of graphs that have an even drawing.
openaire +3 more sources
Injective chromatic number of outerplanar graphs [PDF]
arXiv, 2017 An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer $k$ that $G$ has a $k-$injective coloring is called injective chromatic number of $G$ and denoted by $\chi_i(G)$. In this paper, the injective chromatic number of outerplanar graphs with maximum degree $\Delta$ and ...
arxiv
k-Colored Point-Set Embeddability of Outerplanar Graphs [PDF]
, 2007 Emilio Di Giacomo +5 more
openalex +1 more source
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs [PDF]
, 2011 Victor Chepoi +4 more
openalex +1 more source