Journal article

Colour degree matrices of graphs with at most one cycle

Abstract:: Colour degree matrix problems, also known as edge-disjoint realisation and edge packing problems, have connections for example to discrete tomography. Necessary and sufficient conditions are known for a demand matrix to be the colour degree matrix of an edge-coloured forest. We give necessary and sufficient conditions for a demand matrix to be realisable by a graph with at most one cycle.

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Hillebrand, A., & McDiarmid, C. (2015). Colour degree matrices of graphs with at most one cycle. Discrete Applied Mathematics, 209(August 2016), 144–152.

MLA Style

Hillebrand, A., and C. McDiarmid. “Colour Degree Matrices of Graphs with at Most One Cycle.” Discrete Applied Mathematics, vol. 209, no. August 2016, Elsevier, 2015, pp. 144–52.

Chicago Style

Hillebrand, A, and C McDiarmid. 2015. “Colour Degree Matrices of Graphs with at Most One Cycle.” Discrete Applied Mathematics 209 (August 2016): 144–52.
Share
Print

Access Document

Files:: CycleDegreeFinal.pdf

(Preview, Accepted manuscript, pdf, 271.0KB, Terms of use)

Publisher copy:: 10.1016/j.dam.2015.07.025

Authors

+ Hillebrand, A More by this author

Role:: Author

+ McDiarmid, C More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Statistics
Oxford college:: Corpus Christi College
Role:: Author

+ EPSRC More from this funder

+ Thales UK More from this funder

Publisher:: Elsevier
Journal:: Discrete Applied Mathematics More from this journal
Volume:: 209
Issue:: August 2016
Pages:: 144-152
Publication date:: 2015-08-17
Acceptance date:: 2015-07-24
DOI:: 10.1016/j.dam.2015.07.025
ISSN:: 0166-218X

Keywords:: discrete tomography

edge-disjoint realisations

edge packing

SBTMR

degree constrained edge-partitioning

colour degree matrix
Pubs id:: pubs:542933
UUID:: uuid:b98ffede-18af-411f-9e87-a436f6578f22
Local pid:: pubs:542933
Source identifiers:: 542933
Deposit date:: 2018-10-10

Terms of use

Copyright holder:: Elsevier
Copyright date:: 2015
Notes:: © 2015 Elsevier B.V. All rights reserved. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.dam.2015.07.025

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP