On the complexity of finding a sun in a graph
| dc.creator | Hoang, Chinh T. | |
| dc.date | 2008-07-03 | |
| dc.date.accessioned | 2026-07-07T09:48:11Z | |
| dc.date.available | 2026-07-07T09:48:11Z | |
| dc.description | The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain an induced cycle of length at least four. A graph is strongly chordal if it is chordal and every even cycle has a chord joining vertices whose distance on the cycle is odd. Farber proved that a graph is strongly chordal if and only if it is chordal and contains no induced suns. There are well known polynomial-time algorithms for recognizing a sun in a chordal graph. Recently, polynomial-time algorithms for finding a sun for a larger class of graphs, the so-called HHD-free graphs, have been discovered. In this paper, we prove the problem of deciding whether an arbitrary graph contains a sun in NP-complete. | |
| dc.identifier | https://arxiv.org/abs/0807.0462 | |
| dc.identifier | http://arxiv.org/abs/0807.0462 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164120 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | On the complexity of finding a sun in a graph | |
| dc.type | text |