On some algorithms and properties of comparability graphs

MaRDI QIDQ5959511zbMATH OpenFDO

Authors S. E. Markosyan

Publication date 24 October 2002

Published in Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences (Search for Journal in Brave)

zbMATH Keywords

algorithmscomparability graphsindependent setspermutation graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On Comparability and Permutation Graphs
• scientific article; zbMATH DE number 3908482
• scientific article; zbMATH DE number 3888924
• scientific article; zbMATH DE number 2081001
• \(P_ 4\)-comparability graphs

Cited in

(10)

• Ramsey-type results for unions of comparability graphs
• scientific article; zbMATH DE number 3847443 (Why is no real title available?)
• On Comparability and Permutation Graphs
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• scientific article; zbMATH DE number 3965452 (Why is no real title available?)
• scientific article; zbMATH DE number 1151797 (Why is no real title available?)
• Neighborhood classes of H-comparability graphs
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• A relation between the comparability graph and the number of linear extensions

This page was built for publication: On some algorithms and properties of comparability graphs

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