Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T05:21:16.881Z Has data issue: false hasContentIssue false

A Note on Undirected Graphs Realizable as P.O. Sets

Published online by Cambridge University Press:  20 November 2018

C. E. Haff
Affiliation:
University of Waterloo, Waterloo, Ontario
U. S. R. Murty
Affiliation:
University of Waterloo, Waterloo, Ontario
R. C. Wilton
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let (P, ≥) be a p.o. set. The basis graph of (P, ≥) is defined to be the directed graph whose vertex set is P and in which the ordered pair 〈a, b〉 is an edge if and only if b covers a in (P, ≥).

Let D be a directed graph. All graphs considered in this note are finite and are free of loops and multiple edges.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970