On {claw, antenna, net}-free graphs

MaRDI QIDQ2937352zbMATHFDO

Authors Mihai Talmaciu

Publication date 8 January 2015

zbMATH Keywords

claw-free graphsrecognition algorithmasteroidal triple-free graphsnet-free graphsweakly decompositionantenna-free graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Claw-free graphs. IV: Decomposition theorem
• Claw-free graphs---a survey
• scientific article; zbMATH DE number 5626049
• Recognition algorithm for diamond-free graphs
• Claw-free graphs. V. Global structure

Cited in

(1)

• Recognition algorithm for diamond-free graphs

This page was built for publication: On {claw, antenna, net}-free graphs

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