Results 81 to 90 of about 886,125 (210)

On Separating Path and Tree Systems in Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ...
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky   +8 more
doaj   +1 more source

Planar linear arrangements of outerplanar graphs

IEEE Transactions on Circuits and Systems, 1988
Given an n-vertex outerplanar graph G, we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i,j) of G does not exceed a given bandwidth b(i,j), the total edge length and the cutwidth of the layout
Frederickson, Greg N., Hambrusch, Susanne E.   +1 more
openaire   +3 more sources

Planar rectilinear drawings of outerplanar graphs in linear time [PDF]

, 2021
Fabrizio Frati
openalex   +1 more source

DEFICIENCY OF OUTERPLANAR GRAPHS

Proceedings of the YSU A: Physical and Mathematical Sciences, 2017
An edge-coloring of a graph G with colors $1,2,...,t$ is an interval $t$-coloring, if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable, if it has an interval $t$-coloring for some positive integer $t$.
openaire   +1 more source

Independent sets versus 4-dominating sets in outerplanar graphs [PDF]

, 2023
Dmitrii Taletskii
openalex   +1 more source

The giant component and 2-core in sparse random outerplanar graphs [PDF]

, 2020
Mihyun Kang, Michael Missethan
openalex   +1 more source

The ratio of the numbers of odd and even cycles in outerplanar graphs [PDF]

, 2021
Akihiro Higashitani, Naoki Matsumoto
openalex   +1 more source

Injective Chromatic Number of Outerplanar Graphs

Taiwanese Journal of Mathematics, 2018
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 $ _i(G)$. In this paper, the injective chromatic number of outerplanar graphs with maximum degree $ $ and girth $
Mozafari-Nia, Mahsa, Omoomi, Behnaz
openaire   +3 more sources

Exploring Geometrical Properties of Annihilator Intersection Graph of Commutative Rings

Axioms
Let Λ denote a commutative ring with unity and D(Λ) denote a collection of all annihilating ideals from Λ. An annihilator intersection graph of Λ is represented by the notation AIG(Λ).
A. Khabyah, M. A. Ansari
semanticscholar   +1 more source

Oriented colorings of 2-outerplanar graphs

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esperet, Louis, Ochem, Pascal
openaire   +3 more sources