Results 81 to 90 of about 16,950 (147)
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Optimally edge-colouring outerplanar graphs is in NC [PDF]
We prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)
Gibbons, Alan (Alan M.) +1 more
core
Colouring exact distance graphs of chordal graphs
, 2019 For a graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$.
Quiroz, Daniel A.
core
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