On the recognition of bipolarizable and P₄-simplicial graphs

MaRDI QIDQ5387659zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

Publication date 27 May 2008

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

zbMATH Keywords

Raspail graphsrecognition algorithmrecognition problemsimplicial graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
• Recognition of some perfectly orderable graph classes
• Bipolarizable graphs
• scientific article; zbMATH DE number 2081001
• \(P_ 4\)-comparability graphs

Cited in

(5)

• Recognizing the \(P_4\)-structure of bipartite graphs
• Recognition of some perfectly orderable graph classes
• Characterization and recognition of some opposition and coalition graph classes
• Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
• Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles

This page was built for publication: On the recognition of bipolarizable and \(P_4\)-simplicial graphs

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