Results 1 to 10 of about 871,833 (190)
Outerplanar graph drawings with few slopes [PDF]
Computational geometry, 2014 We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +5 more sources
Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero-Divisor Graph of Commutative Rings
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let A be a commutative ring with unity and let set of all zero divisors of A ...
A. Alanazi, M. Nazim, Nadeem ur Rehman
semanticscholar +3 more sources
The 2-center Problem in Maximal Outerplanar Graph [PDF]
arXiv.org, 2022 We consider the problem of computing 2-center in maximal outerplanar graph. In this problem, we want to find an optimal solution where two centers cover all the vertices with the smallest radius. We provide the following result.
Hsiu-Fu Yeh
semanticscholar +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.
G. Borradaile +2 more
semanticscholar +1 more source
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 [PDF]
Algorithmica, 2017 Deciding if a graph has a square root is a classical problem, which has been studied extensively both from graph-theoretic and algorithmic perspective. As the problem is NP-complete, substantial effort has been dedicated to determining the complexity of ...
P. Golovach +4 more
semanticscholar +1 more source
Clique-Relaxed Graph Coloring [PDF]
, 2011 We define a generalization of the chromatic number of a graph G called the k-clique-relaxed chromatic number, denoted χ(k)(G). We prove bounds on χ(k)(G) for all graphs G, including corollaries for outerplanar and planar graphs.
Dunn, Charles +5 more
core +2 more sources
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs [PDF]
, 2016 We present space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\min\{m,n\log \log n\})$ bits.
Kammer, Frank +2 more
core +2 more sources
Definability Equals Recognizability for $k$-Outerplanar Graphs [PDF]
, 2015 One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle ...
Bodlaender, Hans L., Jaffke, Lars
core +5 more sources
Rainbow subgraphs in edge-colored planar and outerplanar graphs
Discrete Mathematics Letters, 2023 Let G be a class of graphs. The strong rainbow number of the graph H in G is the minimum number of colors k such that every graph G ∈ G admits an edge coloring with at most k colors in which all copies of H are rainbow ...
J. Czap
semanticscholar +1 more source
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources