scientific article; zbMATH DE number 2081001

MaRDI QIDQ4474099zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230320.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
• scientific article; zbMATH DE number 1953107
• \(P_ 4\)-comparability graphs
• A characterization of \(P_{4}\)-comparability graphs
• Recognition algorithm for \(P_4\)-tidy graphs
• Parallel algorithms for P4-comparability graphs
• On the recognition of \(P_4\)-indifferent graphs
• scientific article; zbMATH DE number 4206028
• Recognition and isomorphism of tree-like \(P_4\)-connected graphs
• A linear-time recognition algorithm for \(P_{4}\)-reducible graphs

Cited in

(9)

• A characterization of \(P_{4}\)-comparability graphs
• \(P_ 4\)-comparability graphs
• scientific article; zbMATH DE number 1953107 (Why is no real title available?)
• Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
• Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
• On some algorithms and properties of comparability graphs
• On the \(P_4\)-components of graphs
• scientific article; zbMATH DE number 4206028 (Why is no real title available?)
• On the recognition of bipolarizable and \(P_4\)-simplicial 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 Q4474099)