Home > Research > Publications & Outputs > A constructive characterisation of circuits in ...

Research

Associated organisational units

Electronic data

  • MNcircuitsSubmitted

    Rights statement: This is the peer reviewed version of the following article: McCourt TA, Nixon A. A constructive characterisation of circuits in the simple (2,1)‐sparse matroid. J Graph Theory. 2018;89:150–175. https://doi.org/10.1002/jgt.22245 which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/jgt.22245/abstract This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.

    Accepted author manuscript, 380 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

A constructive characterisation of circuits in the simple (2,1)-sparse matroid

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A constructive characterisation of circuits in the simple (2,1)-sparse matroid. / McCourt, Thomas; Nixon, Anthony Keith.
In: Journal of Graph Theory, Vol. 89, No. 2, 10.2018, p. 150-175.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

McCourt, T & Nixon, AK 2018, 'A constructive characterisation of circuits in the simple (2,1)-sparse matroid', Journal of Graph Theory, vol. 89, no. 2, pp. 150-175. https://doi.org/10.1002/jgt.22245

APA

McCourt, T., & Nixon, A. K. (2018). A constructive characterisation of circuits in the simple (2,1)-sparse matroid. Journal of Graph Theory, 89(2), 150-175. https://doi.org/10.1002/jgt.22245

Vancouver

McCourt T, Nixon AK. A constructive characterisation of circuits in the simple (2,1)-sparse matroid. Journal of Graph Theory. 2018 Oct;89(2):150-175. Epub 2018 Feb 6. doi: 10.1002/jgt.22245

Author

McCourt, Thomas ; Nixon, Anthony Keith. / A constructive characterisation of circuits in the simple (2,1)-sparse matroid. In: Journal of Graph Theory. 2018 ; Vol. 89, No. 2. pp. 150-175.

Bibtex

@article{ec4a8f2251d2427a86d934f0c36fa6d1,
title = "A constructive characterisation of circuits in the simple (2,1)-sparse matroid",
keywords = "count matroid, constructive characterisation, rigidity",
author = "Thomas McCourt and Nixon, {Anthony Keith}",
note = "This is the peer reviewed version of the following article: McCourt TA, Nixon A. A constructive characterisation of circuits in the simple (2,1)‐sparse matroid. J Graph Theory. 2018;89:150–175. https://doi.org/10.1002/jgt.22245 which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/jgt.22245/abstract This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.",
year = "2018",
month = oct,
doi = "10.1002/jgt.22245",
language = "English",
volume = "89",
pages = "150--175",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - A constructive characterisation of circuits in the simple (2,1)-sparse matroid

AU - McCourt, Thomas

AU - Nixon, Anthony Keith

N1 - This is the peer reviewed version of the following article: McCourt TA, Nixon A. A constructive characterisation of circuits in the simple (2,1)‐sparse matroid. J Graph Theory. 2018;89:150–175. https://doi.org/10.1002/jgt.22245 which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/jgt.22245/abstract This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.

PY - 2018/10

Y1 - 2018/10

KW - count matroid

KW - constructive characterisation

KW - rigidity

U2 - 10.1002/jgt.22245

DO - 10.1002/jgt.22245

M3 - Journal article

VL - 89

SP - 150

EP - 175

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -