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

DOI10.1016/j.dam.2023.09.002OpenAlexW4387112965MaRDI QIDQ6184324

Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.002

zbMATH Keywords

enumerationdistance-hereditary graphgraph isomorphismPtolemaic graph\((6, 2)\)-chordal bipartite graph3-leaf power graph

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Random generation and enumeration of bipartite permutation graphs
• Efficient enumeration of non-isomorphic Ptolemaic graphs
• Structure and linear time recognition of 3-leaf powers
• Laminar structure of ptolemaic graphs with applications
• Distance-hereditary graphs
• Graph classes between parity and distance-hereditary graphs
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Reverse search for enumeration
• On Graph Powers for Leaf-Labeled Trees
• Counting Interval Graphs
• A Linear Recognition Algorithm for Cographs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A characterization of ptolemaic graphs
• An Exact Enumeration of Distance-Hereditary Graphs
• Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations
• Graph-Theoretic Concepts in Computer Science

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