The following pages link to (Q4373674):
Displaying 4 items.
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Dynamic Programming for H-minor-free Graphs (Q2914314) (← links)
- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (Q3612594) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)