Increasing spanning forests in graphs and simplicial complexes

Joshua Hallam; Jeremy L. Martin; Bruce E. Sagan

doi:10.1016/j.ejc.2018.09.011

Increasing spanning forests in graphs and simplicial complexes

Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan

Mathematics, Statistics and Data Science

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

Original language	English
Pages (from-to)	178-198
Number of pages	21
Journal	European Journal of Combinatorics
Volume	76
DOIs	https://doi.org/10.1016/j.ejc.2018.09.011
State	Published - Feb 2019

ASJC Scopus Subject Areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.ejc.2018.09.011

Cite this

@article{184248a07fa649248fb3cee057bbfd8d,

title = "Increasing spanning forests in graphs and simplicial complexes",

author = "Joshua Hallam and Martin, {Jeremy L.} and Sagan, {Bruce E.}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Ltd",

year = "2019",

month = feb,

doi = "10.1016/j.ejc.2018.09.011",

language = "English",

volume = "76",

pages = "178--198",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Elsevier",

}

TY - JOUR

T1 - Increasing spanning forests in graphs and simplicial complexes

AU - Hallam, Joshua

AU - Martin, Jeremy L.

AU - Sagan, Bruce E.

PY - 2019/2

Y1 - 2019/2

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

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

U2 - 10.1016/j.ejc.2018.09.011

DO - 10.1016/j.ejc.2018.09.011

M3 - Article

AN - SCOPUS:85055742489

SN - 0195-6698

VL - 76

SP - 178

EP - 198

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

Increasing spanning forests in graphs and simplicial complexes

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this