Results 81 to 90 of about 1,772 (132)
Domination of triangulated discs and maximal outerplanar graphs
Applied Mathematics and ComputationzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarne Renders +2 more
openaire +1 more source
Maxregularity and Maximal Outerplanar Graphs
Electronic Notes in Discrete Mathematics, 1999 R.M.N.D. Rodrigues +2 more
openaire +1 more source
On the Vertex Separation of Maximal Outerplanar Graphs
Serdica Journal of Computing, 2008 We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability ...
openaire +2 more sources
Bounds on the Euler Sombor index of maximal outerplanar graphs [PDF]
Electronic Journal of MathematicsYifan Hu +3 more
doaj +1 more source
Comparison and enumeration of chemical graphs. [PDF]
Comput Struct Biotechnol J, 2013 Akutsu T, Nagamochi H.
europepmc +1 more source
The total chord length of maximal outerplanar graphs
We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest path in $\mathcal{C}$ between its endpoints. We define the total chord length of a graph as the sum of lengths of all
Broadus, Haley, Pavelescu, Elena
openaire +2 more sources
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Discrete Comput Geom, 2016 Aurenhammer F, Walzl G.
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Theory Comput Syst, 2018 Golovach PA +3 more
europepmc +1 more source
Charge group partitioning in biomolecular simulation. [PDF]
J Comput Biol, 2013 Canzar S +7 more
europepmc +1 more source