Getting new algorithmic results by extending distance-hereditary graphs via split composition
In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components. This graph class extends the well-known class of distance-hereditary graphs, which correspon...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2021-07-01
|
| Series: | PeerJ Computer Science |
| Subjects: | |
| Online Access: | https://peerj.com/articles/cs-627.pdf |