Hole and antihole detection in graphs

MaRDI QIDQ5501347zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

Publication date 3 August 2015

zbMATH Keywords

holeantiholeweakly chordal graphco-connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40)

Recommendations

• Detecting holes and antiholes in graphs
• Finding large holes
• Detecting even holes
• Finding a shortest even hole in polynomial time
• Finding houses and holes in graphs

Cited in

(8)

• Algorithms for 3PC(⋅, ⋅)-free Berge graphs
• Smallest odd holes in claw-free graphs (extended abstract)
• Detecting holes and antiholes in graphs
• A faster algorithm to recognize even-hole-free graphs
• Characterizations of graphs with stretch number less than 2
• Chordless paths through three vertices
• Odd Hole Recognition in Graphs of Bounded Clique Size
• A faster algorithm to recognize even-hole-free graphs

This page was built for publication: Hole and antihole detection in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501347)