Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs

MaRDI QIDQ5387667zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

Publication date 27 May 2008

Full work available at URL https://eudml.org/doc/129521, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

zbMATH Keywords

HH-free graphsHHD-free graphsperfect graphsrecognition algorithmrecognition problemWPO-graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
• An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
• Graph-Theoretic Concepts in Computer Science

Cited in

(11)

• Welsh-Powell opposition graphs
• Finding a sun in building-free graphs
• An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
• Characterization and recognition of some opposition and coalition graph classes
• An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
• A simple nc recognition algorithm for welsh-powell opposition graphs
• Induced embeddings into Hamming graphs
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
• A new characterization of HH-free graphs

This page was built for publication: Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs

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