Doubly lexical orderings of matrices
SIAM Journal on Computing
Three partition refinement algorithms
SIAM Journal on Computing
Graph classes: a survey
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms (TALG)
An O(n3)-Time Recognition Algorithm for hhds-free Graphs
Graphs and Combinatorics
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
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 (graphs containing no house, hole, or domino), have been discovered. In this paper, we prove the problem of deciding whether an arbitrary graph contains a sun is NP-complete.