Partitioning a planar graph of girth 10 into a forest and a matching

A. Bassa; J. Burns; J. Campbell; A. Deshpande; J. Farley; M. Halsey; S. Y. Ho; D. Kleitman; S. Michalakis; P. O. Persson; P. Pylyavskyy; L. Rademacher; A. Riehl; M. Rios; J. Samuel; B. E. Tenner; A. Vijayasarathy; L. Zhao

doi:10.1111/j.1467-9590.2009.00468.x

Partitioning a planar graph of girth 10 into a forest and a matching

A. Bassa, J. Burns, J. Campbell, A. Deshpande, J. Farley, M. Halsey, S. Y. Ho, D. Kleitman, S. Michalakis, P. O. Persson, P. Pylyavskyy, L. Rademacher, A. Riehl, M. Rios, J. Samuel, B. E. Tenner, A. Vijayasarathy, L. Zhao

School of Mathematics

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated.

Original language	English (US)
Pages (from-to)	213-228
Number of pages	16
Journal	Studies in Applied Mathematics
Volume	124
Issue number	3
DOIs	https://doi.org/10.1111/j.1467-9590.2009.00468.x
State	Published - Apr 2010

Publisher link

10.1111/j.1467-9590.2009.00468.x

Find It

Find It at U of M Libraries

Cite this

Bassa, A., Burns, J., Campbell, J., Deshpande, A., Farley, J., Halsey, M., Ho, S. Y., Kleitman, D., Michalakis, S., Persson, P. O., Pylyavskyy, P., Rademacher, L., Riehl, A., Rios, M., Samuel, J., Tenner, B. E., Vijayasarathy, A., & Zhao, L. (2010). Partitioning a planar graph of girth 10 into a forest and a matching. Studies in Applied Mathematics, 124(3), 213-228. https://doi.org/10.1111/j.1467-9590.2009.00468.x

Bassa, A, Burns, J, Campbell, J, Deshpande, A, Farley, J, Halsey, M, Ho, SY, Kleitman, D, Michalakis, S, Persson, PO, Pylyavskyy, P, Rademacher, L, Riehl, A, Rios, M, Samuel, J, Tenner, BE, Vijayasarathy, A & Zhao, L 2010, 'Partitioning a planar graph of girth 10 into a forest and a matching', Studies in Applied Mathematics, vol. 124, no. 3, pp. 213-228. https://doi.org/10.1111/j.1467-9590.2009.00468.x

@article{e3063e11f2ae4ccc8753ecc5b3c67b9e,

title = "Partitioning a planar graph of girth 10 into a forest and a matching",

abstract = "We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated.",

author = "A. Bassa and J. Burns and J. Campbell and A. Deshpande and J. Farley and M. Halsey and Ho, {S. Y.} and D. Kleitman and S. Michalakis and Persson, {P. O.} and P. Pylyavskyy and L. Rademacher and A. Riehl and M. Rios and J. Samuel and Tenner, {B. E.} and A. Vijayasarathy and L. Zhao",

year = "2010",

month = apr,

doi = "10.1111/j.1467-9590.2009.00468.x",

language = "English (US)",

volume = "124",

pages = "213--228",

journal = "Studies in Applied Mathematics",

issn = "0022-2526",

publisher = "Wiley-Blackwell",

number = "3",

}

TY - JOUR

T1 - Partitioning a planar graph of girth 10 into a forest and a matching

AU - Bassa, A.

AU - Burns, J.

AU - Campbell, J.

AU - Deshpande, A.

AU - Farley, J.

AU - Halsey, M.

AU - Ho, S. Y.

AU - Kleitman, D.

AU - Michalakis, S.

AU - Persson, P. O.

AU - Pylyavskyy, P.

AU - Rademacher, L.

AU - Riehl, A.

AU - Rios, M.

AU - Samuel, J.

AU - Tenner, B. E.

AU - Vijayasarathy, A.

AU - Zhao, L.

PY - 2010/4

Y1 - 2010/4

N2 - We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated.

AB - We prove that any finite planar graph with girth at least 10 can have its edges partitioned to form two graphs on the same vertices, one of which is a forest, and the other of which is a matching. Several related results are also demonstrated.

UR - http://www.scopus.com/inward/record.url?scp=77953101250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953101250&partnerID=8YFLogxK

U2 - 10.1111/j.1467-9590.2009.00468.x

DO - 10.1111/j.1467-9590.2009.00468.x

M3 - Article

AN - SCOPUS:77953101250

SN - 0022-2526

VL - 124

SP - 213

EP - 228

JO - Studies in Applied Mathematics

JF - Studies in Applied Mathematics

IS - 3

ER -

Partitioning a planar graph of girth 10 into a forest and a matching

Abstract

Publisher link

Find It

Other files and links

Fingerprint

Cite this