Results 101 to 110 of about 231 (167)
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System SciencesWe study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
Amotz Bar-Noy +4 more
openaire +3 more sources
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
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Sci Rep, 2018 Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
Comparison and enumeration of chemical graphs. [PDF]
Comput Struct Biotechnol J, 2013 Akutsu T, Nagamochi H.
europepmc +1 more source
Charge group partitioning in biomolecular simulation. [PDF]
J Comput Biol, 2013 Canzar S +7 more
europepmc +1 more source
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Discrete Comput Geom, 2016 Aurenhammer F, Walzl G.
europepmc +1 more source
Choosability with separation of cycles and outerplanar graphs
Discussiones Mathematicae Graph Theory, 2023 Jean-Christophe Godin, Oliver Togni
doaj +1 more source