Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs

DOI10.1007/978-3-030-68211-8_23OpenAlexW3131940099MaRDI QIDQ2232254

Mengze Qian, Kazuaki Yamazaki, Ryuhei Uehara

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_23

zbMATH Keywords

enumerationdistance-hereditary graphgraph isomorphismPtolemaic graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs

Cites Work

• Random generation and enumeration of bipartite permutation graphs
• Efficient enumeration of non-isomorphic Ptolemaic graphs
• Laminar structure of ptolemaic graphs with applications
• Distance-hereditary graphs
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Algorithmic graph theory and perfect graphs
• Reverse search for enumeration
• Counting Interval Graphs
• A characterization of ptolemaic graphs
• Graph Classes: A Survey
• Efficient enumeration of non-isomorphic interval graphs
• A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
• Graph-Theoretic Concepts in Computer Science
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs

This page was built for publication: Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs