Results 91 to 100 of about 3,509 (176)

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

The Cayley Sum Graph of Ideals of a Lattice

Discussiones Mathematicae - General Algebra and Applications, 2020
Let L be a lattice, 𝒥(L) be the set of ideals of L and S be a subset of 𝒥 (L). In this paper, we introduce an undirected Cayley graph of L, denoted by ΓL,S with elements of 𝒥 (L) as the vertex set and, for two distinct vertices I and J, I is adjacent to ...
Afkhami Mojgan, Hassankhani Mehdi, Khashyarmanesh Kazem   +2 more
doaj   +1 more source

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

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

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core   +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

Characterizations of outerplanar graphs

Discrete Mathematics, 1979
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs.
openaire   +1 more source

Strict confluent drawing

Journal of Computational Geometry, 2016
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be ...
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek   +5 more
doaj   +1 more source

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]

Algorithmica, 2022
Golovach PA, Zehavi M.
europepmc   +1 more source

Odd 4-Coloring of Outerplanar Graphs

Graphs and Combinatorics
A proper $k$-coloring of $G$ is called an odd coloring of $G$ if for every vertex $v$, there is a color that appears at an odd number of neighbors of $v$. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar graph is odd 5-colorable.
Kashima, Masaki, Zhu, Xuding
openaire   +2 more sources