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