Pages that link to "Item:Q2545312"
From MaRDI portal
The following pages link to Partially ordered sets and their comparability graphs (Q2545312):
Displaying 13 items.
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- Is there a diagram invariant? (Q1115889) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- Incremental construction of 2-structures (Q1322177) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Drawing and encoding two-dimensional posets (Q1392206) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- 3-uniform hypergraphs: modular decomposition and realization by tournaments (Q3303522) (← links)
