Pages that link to "Item:Q5941278"
From MaRDI portal
The following pages link to Finding houses and holes in graphs (Q5941278):
Displaying 7 items.
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
