Characterization problems for graphs, partially ordered sets, lattices, and families of sets
Open Access
- 13 December 1976
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 16 (4), 361-381
- https://doi.org/10.1016/s0012-365x(76)80011-8
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Some theorems on graphs and posetsDiscrete Mathematics, 1976
- A forbidden subposet characterization of an order — dimension inequalityTheory of Computing Systems, 1976
- The Dimension of a Comparability GraphProceedings of the American Mathematical Society, 1976
- Planar LatticesCanadian Journal of Mathematics, 1975
- Inequalities in dimension theory for posetsProceedings of the American Mathematical Society, 1975
- Crowns, Fences, and Dismantlable LatticesCanadian Journal of Mathematics, 1974
- Partial orders of dimension 2Networks, 1972
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Characterizing circular-arc graphsBulletin of the American Mathematical Society, 1970
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967