Recognition algorithm for diamond-free graphs

MaRDI QIDQ3053461zbMATH OpenFDO

Authors Mihai Talmaciu, Elena Nechita

Publication date 29 October 2010

zbMATH Keywords

diamond graphrecognition algorithmweakly decomposition

Mathematics Subject Classification ID

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

Recommendations

• On graphs without a \(C_{4}\) or a diamond
• On {claw, antenna, net}-free graphs
• scientific article; zbMATH DE number 5626049
• Strong cliques in diamond-free graphs
• Decomposing and clique-coloring (diamond, odd-hole)-free graphs

Cited in

(8)

• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
• On {claw, antenna, net}-free graphs
• Recognizing Dart-Free Perfect Graphs
• Arboricity, \(h\)-index, and dynamic algorithms
• Graph-based data clustering with overlaps
• On graphs without a \(C_{4}\) or a diamond
• Graph-Based Data Clustering with Overlaps
• Strong cliques in diamond-free graphs

This page was built for publication: Recognition algorithm for diamond-free graphs

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