Results 41 to 50 of about 3,997 (179)
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
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Journal of Applied Mathematics, Volume 2020, Issue 1, 2020., 2020 Let G = (V, E) be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph G a proper coloring where no two adjacent vertices are signed with the same color. Alice′s goal is to color the set of vertices using the minimum number of colors, which is called game chromatic number and is denoted by χg(G), while Bob′s goal is
Ramy Shaheen +3 more
wiley +1 more source
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
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
Outerplanar Obstructions for Matroid Pathwidth
Electronic Notes in Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsonas, Athanassios +2 more
openaire +4 more sources
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
Simultaneous coloring of vertices and incidences of outerplanar graphs
Electronic Journal of Graph Theory and Applications, 2023 A vi-simultaneous proper k-coloring of a graph G is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set V(G)∪I(G) receive distinct colors, where I(G) is the set of incidences of G.
Mahsa Mozafari-Nia, Moharram N. Iradmusa
doaj +1 more source
Pixel and Voxel Representations of Graphs
, 2015 We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose cells we call pixels in 2D and voxels in 3D.
A Bezdek +31 more
core +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Fuzzy Outerplanar Graphs and Its Applications
International Journal of Computational Intelligence SystemsThe concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar +3 more
doaj +1 more source