Finding houses and holes in graphs
From MaRDI portal
Publication:5941278
DOI10.1016/S0304-3975(00)00005-0zbMath0973.68184MaRDI QIDQ5941278
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs, A new characterization of HH-free graphs, Recognition of some perfectly orderable graph classes, Finding a sun in building-free graphs, An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs, Classes of perfect graphs, Probe Ptolemaic Graphs
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