The Library
Split permutation graphs
Tools
Korpelainen, Nicholas, Lozin, Vadim V. and Mayhill, Colin (2014) Split permutation graphs. Graphs and Combinatorics, Volume 30 (Number 3). pp. 633-646. doi:10.1007/s00373-013-1290-3 ISSN 0911-0119.
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/s00373-013-1290-3
Abstract
The class of split permutation graphs is the intersection of two important classes, the split graphs and permutation graphs. It also contains an important subclass, the threshold graphs. The class of threshold graphs enjoys many nice properties. In particular, these graphs have bounded clique-width and they are well-quasi-ordered by the induced subgraph relation. It is known that neither of these two properties is extendable to split graphs or to permutation graphs. In the present paper, we study the question of extendability of these two properties to split permutation graphs. We answer this question negatively with respect to both properties. Moreover, we conjecture that with respect to both of them the split permutation graphs constitute a critical class.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Graphs and Combinatorics | ||||
Publisher: | Springer Japan KK | ||||
ISSN: | 0911-0119 | ||||
Official Date: | May 2014 | ||||
Dates: |
|
||||
Volume: | Volume 30 | ||||
Number: | Number 3 | ||||
Page Range: | pp. 633-646 | ||||
DOI: | 10.1007/s00373-013-1290-3 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |