View article

(in English) Enumeration of constrained graphs is important for both graph-theoretical study and testcase generation. We propose a method to enumerate constrained labeled graphs using answer set programming (ASP). ASP is a kind of declarative programming, and we can enumerate solutions by writing the definition of the solutions. We propose several encodings for subclasses of perfect graphs: chordal, split, and threshold graphs. We compare the efficiency of the encodings by experiment.