Partially ordered sets and their comparability graphs

DOI10.1007/BF00967091zbMath0214.23303OpenAlexW2093630431MaRDI QIDQ2545312

N. D. Filippov, L. N. Shevrin

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

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

Related Items (max. 100)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Comparability Graph of a Tree
• A Characterization of Comparability Graphs and of Interval Graphs

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