Pages that link to "Item:Q5897547"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897547):
Displaying 7 items.
- Edge search number of cographs (Q415273) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
