Liu, Chun-Hung. A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three. Retrieved from https://par.nsf.gov/biblio/10320227. Journal of Combinatorial Theory, Series B 154.C Web. doi:10.1016/j.jctb.2022.01.005.
Liu, Chun-Hung. A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three. Journal of Combinatorial Theory, Series B, 154 (C). Retrieved from https://par.nsf.gov/biblio/10320227. https://doi.org/10.1016/j.jctb.2022.01.005
@article{osti_10320227,
place = {Country unknown/Code not available},
title = {A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three},
url = {https://par.nsf.gov/biblio/10320227},
DOI = {10.1016/j.jctb.2022.01.005},
abstractNote = {},
journal = {Journal of Combinatorial Theory, Series B},
volume = {154},
number = {C},
author = {Liu, Chun-Hung},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.