Characterization problems for graphs, partially ordered sets, lattices, and families of sets
type: Item
instance of: scholarly article
title: Characterization problems for graphs, partially ordered sets, lattices, and families of sets
zbMATH Open document ID: 0356.06007
DOI: 10.1016/S0012-365X(76)80011-8
author: William T. Trotter
author: John I. jun. Moore
published in: Discrete Mathematics
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3554299
Wikidata QID: Q106106673
MaRDI profile type: Publication
cites work: Partial orders of dimension 2
cites work: Q5570136
cites work: Q5331549
cites work: Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
cites work: Q5545841
cites work: Faithful Representation of a Family of Sets by a Set of Intervals
cites work: Intransitive indifference with unequal indifference intervals
cites work: Transitiv orientierbare Graphen
cites work: Q3291037
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Q5598258
cites work: Q5598296
cites work: Planar Lattices
cites work: Certain partially ordered sets of dimension three
cites work: Crowns, Fences, and Dismantlable Lattices
cites work: Arbres et dimension des ordres
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Dimension of the crown \(S^k_n\)
cites work: Inequalities in Dimension Theory for Posets
cites work: A generalization of Hiraguchi's: Inequality for posets
cites work: A forbidden subposet characterization of an order — dimension inequality
cites work: On the complexity of posets
cites work: Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
cites work: Some theorems on graphs and posets
cites work: The Dimension of a Comparability Graph
cites work: Matrix characterizations of circular-arc graphs
cites work: Characterizing circular-arc graphs
cites work: Structure theorems for some circular-arc graphs
cites work: A structure theorem for the consecutive 1's property
full work available at URL: s0012-365x(76)80011-8
OpenAlex ID: W2068654529
description: scientific article; zbMATH DE number 3554299