| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652562 | Electronic Notes in Discrete Mathematics | 2009 | 8 Pages |
Abstract
We introduce a new representation of proper interval graphs that can be computed in linear time and stored in O(n) space. This representation is a 2-dimensional vertex partition. It is particularly interesting with respect to clique-width. Based on this representation, we prove new upper bounds on the clique-width of proper interval graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
