Getting new algorithmic results by extending distance-hereditary graphs via split composition

In this paper, we consider the graph class denoted as Gen(∗;P(3),C(3),C(5)). It contains all graphs that can be generated by the split composition operation using path P(3), cycle C(3), and any cycle C(5) as components. This graph class extends the well-known class of distance-hereditary graphs, whi...

Descripción completa

Detalles Bibliográficos
Autores principales: Cicerone, Serafino, Di Stefano, Gabriele
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2021
Materias:
Algorithms and Analysis of Algorithms
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8279144/
https://www.ncbi.nlm.nih.gov/pubmed/34307866
http://dx.doi.org/10.7717/peerj-cs.627

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8279144/
https://www.ncbi.nlm.nih.gov/pubmed/34307866
http://dx.doi.org/10.7717/peerj-cs.627

Ejemplares similares