A Quasi-Hole Detection Algorithm for Recognizing <i>k</i>-Distance-Hereditary Graphs, with <i>k</i> < 2

A Quasi-Hole Detection Algorithm for Recognizing <i>k</i>-Distance-Hereditary Graphs, with <i>k</i> < 2

Cicerone and Di Stefano defined and studied the class of <i>k</i>-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most <i>k</i> times the distance in the whole graph. The defined graphs represent a generalization of the wel...

Full description

Bibliographic Details
Main Author: Serafino Cicerone
Format: Article
Language:English
Published: MDPI AG 2021-03-01
Series:Algorithms
Subjects:
distance-hereditary graphs
stretch number
recognition problem
forbidden subgraphs
hole detection
Online Access:https://www.mdpi.com/1999-4893/14/4/105

Internet

https://www.mdpi.com/1999-4893/14/4/105

Similar Items