Miller, A. and Prosser, P. (2012) Diamond-free degree sequences. Acta Universitatis Sapientiae, Informatica, 4(2), pp. 189-200.
Full text not currently available from Enlighten.
Publisher's URL: http://www.acta.sapientia.ro/acta-info/informatica-main.htm
Abstract
While attempting to classify partial linear spaces produced during the execution of an extension of Stinson's hill-climbing algorithm a new problem arises, that of generating all graphical degree sequences that are diamond-free (i.e. have no diamond as subgraph) and satisfy ad- ditional constraints. We formalize this new problem, propose a constraint programming solution and list all satisfying degree sequences of length 8 to 16 inclusive.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Miller, Professor Alice and Prosser, Dr Patrick |
| Authors: | Miller, A., and Prosser, P. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Acta Universitatis Sapientiae, Informatica |
| ISSN: | 1844-6086 |
| ISSN (Online): | 2066-7760 |
University Staff: Request a correction | Enlighten Editors: Update this record
Deposit and Record Details
Deposit and Record Details