Results 81 to 90 of about 161 (144)
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
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
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 +5 more
doaj +1 more source
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
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 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 CombinatoricsA 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
Definability Equals Recognizability for $k$-Outerplanar Graphs
, 2015 40 pages, 8 ...
Jaffke, Lars, Bodlaender, Hans L.
openaire +7 more sources
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +2 more sources
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source