scientific article; zbMATH DE number 6432456

MaRDI QIDQ5249236zbMATH OpenFDO

Authors Celina Miraglia Herrera de Figueiredo, Guillermo Durán, Luciano N. Grippo, Martín D. Safe, Flavia Bonomo, Jayme L. Szwarcfiter

Publication date 30 April 2015

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2546/0.html

zbMATH Keywords

diamond-free graphsprobe graphs2-clique graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
• On the structure of clique-free graphs
• Strong cliques in diamond-free graphs
• Strong cliques in diamond-free graphs
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• On the connectivity of \(p\)-diamond-free graphs
• On the connectivity of diamond-free graphs
• A characterization of diameter-2-critical graphs whose complements are diamond-free
• The degree-diameter problem for claw-free graphs and hypergraphs
• Probe threshold and probe trivially perfect graphs

Cited in

(1)

• Characterizing and recognizing probe block graphs

This page was built for publication:

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