Recognizing bipolarizable and P _4-simplicial graphs.

DOI10.1007/B93953MaRDI QIDQ5902535zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexityrecognition algorithmforbidden subgraphperfectly orderable graphRaspail graph\(P _{4}\)-simplicial graphbipolarizable graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75)

Recommendations

• On the recognition of bipolarizable and \(P_4\)-simplicial graphs
• Recognition of some perfectly orderable graph classes
• Bipolarizable graphs
• \(P_ 4\)-comparability graphs
• scientific article; zbMATH DE number 2081001

Cited in

(3)

• Recognizing the \(P_4\)-structure of bipartite graphs
• Recognition of some perfectly orderable graph classes
• On the recognition of bipolarizable and \(P_4\)-simplicial graphs

This page was built for publication: Recognizing 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 Q5902535)