scientific article; zbMATH DE number 2081001
From MaRDI portal
Publication:4474099
zbMATH Open1077.05514MaRDI QIDQ4474099FDOQ4474099
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
Title of this publication is not available (Why is that?)
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05)
Cited In (9)
- A characterization of \(P_{4}\)-comparability graphs
- \(P_ 4\)-comparability graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On the \(P_4\)-components of graphs
- 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)
