Results 121 to 130 of about 1,056 (209)
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
, 2013 A proper touching triangle representation R of an n-vertex planar graph consists of a triangle divided into n non-overlapping triangles. A pair of triangles are considered to be adjacent if they share a partial side of positive length. Each triangle in R
Fowler, J. Joseph, J. Joseph Fowler
core +1 more source
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 reconstructing maximal outerplanar graphs
Discrete Mathematics, 1974 Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types ...
openaire +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +2 more sources
Outerplanar and Forest Storyplans
, 2023 We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{frame ...
Zink, Johannes +4 more
core
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
External Memory Algorithms for Outerplanar Graphs
, 1999 We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadth-first search (BFS) and depth-first search (DFS) in outerplanar graphs, and finding a2-separator of size 2 for a given outerplanar graph.
Norbert Zeh +3 more
core +1 more source