Finding houses and holes in graphs

DOI10.1016/S0304-3975(00)00005-0zbMath0973.68184OpenAlexW2020054908MaRDI QIDQ5941278

Chính T. Hoàng, R. Sritharan

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00005-0

zbMATH Keywords

algorithmdominohouseholeperfectly orderable

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ Finding a sun in building-free graphs ⋮ Probe Ptolemaic Graphs ⋮ Classes of perfect graphs ⋮ A new characterization of HH-free graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Recognition of some perfectly orderable graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Meyniel weakly triangulated graphs. I: Co-perfect orderability
• On rigid circuit graphs
• On the complexity of recognizing perfectly orderable graphs
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
• On the semi-perfect elimination
• A New Class of Brittle Graphs
• Bithreshold Graphs
• On brittle graphs
• Four classes of perfectly orderable graphs
• Some classes of perfectly orderable graphs
• Algorithmic Aspects of Vertex Elimination on Graphs