Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

On hereditary properties of the class of graphs with convex quadratic stability number

Tools
- Tools
+ Tools

Cardoso, D. M. and Lozin, Vadim V.. (2012) On hereditary properties of the class of graphs with convex quadratic stability number. Journal of Mathematical Sciences, Vol.182 (No.2). pp. 227-232. ISSN 1072-3374

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s10958-012-0743-1

Abstract

We show that the class of graphs with quadratic stability number is not hereditary. Then we prove that this class contains a unique maximal hereditary subclass and, finally, we characterize this subclass by two forbidden induced subgraphs. © 2012 Springer Science+Business Media, Inc.

Item Type: Journal Article
Divisions: Faculty of Science > Mathematics
Journal or Publication Title: Journal of Mathematical Sciences
Publisher: Springer
ISSN: 1072-3374
Date: 2012
Volume: Vol.182
Number: No.2
Page Range: pp. 227-232
Identification Number: 10.1007/s10958-012-0743-1
Status: Peer Reviewed
Publication Status: Published
URI: http://wrap.warwick.ac.uk/id/eprint/46535

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us