Results 101 to 110 of about 119,166 (199)

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, Rivin, Igor, Streinu, Ileana   +2 more
openaire   +2 more sources

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

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

Nilpotent graphs with crosscap at most two

AKCE International Journal of Graphs and Combinatorics, 2018
Let R be a commutative ring with identity. The nilpotent graph of R, denoted by Γ N ( R ) , is a graph with vertex set Z N ( R ) ∗ , and two vertices x and y are adjacent if and only if x y is nilpotent, where Z N ( R ) = { x ∈ R : x y is nilpotent, for ...
A. Mallika, R. Kala
doaj  

Further results on strong edge-colourings in outerplanar graphs [PDF]

arXiv, 2013
An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we give an improved upper bound for any outerplanar graph which is close to optimal.
arxiv  

Non-Preemptive Tree Packing. [PDF]

Algorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Path-Neighborhood Graphs

Discussiones Mathematicae Graph Theory, 2013
A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized.
Laskar R.C., Mulder Henry Martyn
doaj   +1 more source

On packing chromatic number of subcubic outerplanar graphs [PDF]

arXiv, 2017
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 Sierpi{\'n}ski graphs and hexagonal lattices.In this paper we are interested in the packing chromatic ...
arxiv  

Extremal eigenvalues of outerplanar graphs [PDF]

arXiv
The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are represented. With these characterizations, among all bipartite outerplanar graphs of order $n\geq 55$, the maximum ...
arxiv  

Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs [PDF]

, 1979
S. Mitchell, Terry Beyer, Whitney Jones
openalex   +1 more source

Outerplanar Coarseness of Planar Graphs [PDF]

Missouri Journal of Mathematical Sciences, 2016
The (outer) planar coarseness of a graph is the largest number of pairwise-edge-disjoint non-(outer)planar subgraphs. It is shown that the maximum outerplanar coarseness, over all $n$-vertex planar graphs, lies in the interval $\;\big [\lfloor (n-2)/3 \rfloor, \lfloor (n-2)/2 \rfloor \big ]$.
openaire   +3 more sources