The Library
Sparse regular induced subgraphs in 2P3-free graphs
Tools
Lozin, Vadim V., Mosca, Raffaele and Purcell, Christopher (2013) Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optimization, Volume 10 (Number 4). pp. 304-309. doi:10.1016/j.disopt.2013.08.001 ISSN 1572-5286.
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.disopt.2013.08.001
Abstract
We call graphs of a fixed degree ksparse regular graphs and their complements dense regular graphs. Recently, it was conjectured that finding a maximum regular induced subgraph H in a 2P3-free graph can be solved in polynomial time if and only if H is sparse. In the present paper, we prove the “sparse” part of this conjecture, i.e., we show that for each fixed k, the problem of finding a maximum k-regular induced subgraph in a 2P3-free graph can be solved in polynomial time.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Library of Congress Subject Headings (LCSH): | Graph theory, Polynomials | ||||
Journal or Publication Title: | Discrete Optimization | ||||
Publisher: | Elsevier Science BV | ||||
ISSN: | 1572-5286 | ||||
Official Date: | 2013 | ||||
Dates: |
|
||||
Volume: | Volume 10 | ||||
Number: | Number 4 | ||||
Page Range: | pp. 304-309 | ||||
DOI: | 10.1016/j.disopt.2013.08.001 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Funder: | University of Warwick. Centre for Discrete Mathematics and Its Applications, Engineering and Physical Sciences Research Council (EPSRC) | ||||
Grant number: | EP/I01795X/1 (EPSRC) |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |