Detecting holes and antiholes in graphs

DOI10.1007/s00453-006-1225-yzbMath1108.68090OpenAlexW2073043470MaRDI QIDQ870455

Leonidas Palios, Stavros D. Nikolopoulos

Publication date: 12 March 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-1225-y

Mathematics Subject Classification ID

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

Related Items (6)

Well-partitioned chordal graphs ⋮ Quasimonotone graphs ⋮ Unnamed Item ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds ⋮ Unnamed Item ⋮ A faster algorithm to recognize even-hole-free graphs

This page was built for publication: Detecting holes and antiholes in graphs