Results 31 to 40 of about 584,165 (157)
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
On Pathos Total Semitotal and Entire Total Block Graph of a Tree [PDF]
, 2012 In this communication, the concept of pathos total semitotal and entire total block graph of a tree is introduced. Its study is concentrated only on trees.
Syed Babajan +2 more
core +1 more source
Drawing Outer 1-planar Graphs with Few Slopes
Journal of Graph Algorithms and Applications, 2015 A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees.
Emilio Di Giacomo +2 more
doaj +1 more source
A linear algorithm to recognize maximal generalized outerplanar graphs [PDF]
, 1997 summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs).
Márquez Pérez, Alberto +2 more
core +1 more source
Alpha Labeling of Amalgamated Cycles
Theory and Applications of Graphs, 2022 A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj +1 more source
The Minimal Nonplanar Strong Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley +1 more source
Algorithms, 2013 The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry.
Takeyuki Tamura, Tatsuya Akutsu
doaj +1 more source
On Another Class of Strongly Perfect Graphs
Mathematics, 2022 For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
doaj +1 more source
On the Threshold for Triangulations Inside Convex Polygons
Random Structures &Algorithms, Volume 69, Issue 2, September 2026.ABSTRACT Start with a large convex polygon and add all other edges inside independently with probability p$$ p $$. At what critical threshold pc$$ {p}_c $$ do triangulations of the polygon begin to appear? The first author and Gravner asked this question and observed that pc=Θ(1)$$ {p}_c=\Theta (1) $$, using the relationship with the Catalan numbers ...
Brett Kolesnik +2 more
wiley +1 more source
Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]
TheoretiCSThe stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut +2 more
doaj +1 more source