The Library
Canonical antichains of unit interval and bipartite permutation graphs
Tools
Lozin, Vadim V. and Mayhill, Colin (2011) Canonical antichains of unit interval and bipartite permutation graphs. Order, Vol. 28 (No. 3). pp. 513-522. doi:10.1007/s11083-010-9188-7 ISSN 0167-8094.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/s11083-010-9188-7
Abstract
We study unit interval graphs and bipartite permutation graphs partially ordered by the induced subgraph relation. It is known that neither of these classes is well-quasi-ordered, since each of them contains an infinite antichain. We show that in both cases the antichains are canonical in the sense that any subclass of unit interval or bipartite permutation graphs containing only finitely many graphs from the respective antichain is well-quasi-ordered.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Order | ||||
Publisher: | Springer | ||||
ISSN: | 0167-8094 | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol. 28 | ||||
Number: | No. 3 | ||||
Page Range: | pp. 513-522 | ||||
DOI: | 10.1007/s11083-010-9188-7 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |