The Library
Critical properties of graphs of bounded clique-width
Tools
Lozin, Vadim V. and Milanic, Martin (2013) Critical properties of graphs of bounded clique-width. Discrete Mathematics, Volume 313 (Number 9). pp. 1035-1044. doi:10.1016/j.disc.2013.01.008 ISSN 0012-365X.
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.1016/j.disc.2013.01.008
Abstract
A graph property is a set of graphs closed under isomorphism. Clique-width is a graph parameter which is important in theoretical computer science because many algorithmic problems that are generally NP-hard admit polynomial-time solutions when restricted to graphs of bounded clique-width. Over the last few years, many properties of graphs have been shown to be of bounded clique-width; for many others, it has been shown that the clique-width is unbounded. The goal of the present paper is to tighten the gap between properties of bounded and unbounded clique-width. To this end, we identify new necessary and sufficient conditions for clique-width to be bounded.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Discrete Mathematics | ||||
Publisher: | Elsevier BV | ||||
ISSN: | 0012-365X | ||||
Official Date: | 2013 | ||||
Dates: |
|
||||
Volume: | Volume 313 | ||||
Number: | Number 9 | ||||
Page Range: | pp. 1035-1044 | ||||
DOI: | 10.1016/j.disc.2013.01.008 | ||||
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 |