Pages that link to "Item:Q782198"
From MaRDI portal
The following pages link to Efficient enumeration of non-isomorphic Ptolemaic graphs (Q782198):
Displaying 7 items.
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- On Fast Enumeration of Pseudo Bicliques (Q3000513) (← links)
- Efficient enumeration of non-isomorphic interval graphs (Q4987268) (← links)
- (Q5298912) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)