Partially ordered sets and their comparability graphs

DOI10.1007/BF00967091MaRDI QIDQ2545312zbMATH OpenOpenAlexFDO

Authors L. N. Shevrin, N. D. Filippov

Publication date 1970

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00967091

Mathematics Subject Classification ID

Graph theory (05C99) Partial orders, general (06A06)

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3468907 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• scientific article; zbMATH DE number 3269914 (Why is no real title available?)
• The Comparability Graph of a Tree

Cited in

(13)

• A combinatorial bijection between linear extensions of equivalent orders
• Is there a diagram invariant?
• \(P_ 4\)-trees and substitution decomposition
• Comparability graphs and a new matroid
• The complexity of comparability graph recognition and coloring
• Incremental construction of 2-structures
• A k-structure generalization of the theory of 2-structures
• Drawing and encoding two-dimensional posets
• An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
• Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
• 3-uniform hypergraphs: modular decomposition and realization by tournaments
• Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
• Almost all comparability graphs are UPO

This page was built for publication: Partially ordered sets and their comparability graphs

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