On tree decompositions whose trees are minors
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2024/02/11
-
Journal
-
Indian UGC (journal)
-
Refrences16
-
Pablo Blanco Department of Mathematics Princeton University Princeton New Jersey USA ORCID (unauthenticated)
-
Linda Cook Discrete Math Group Institute for Basic Science Daejeon Republic of Korea ORCID (unauthenticated)
-
Meike Hatzel National Institute of Informatics Tokyo Japan ORCID (unauthenticated)
-
Claire Hilaire LaBRI Université de Bordeaux Bordeaux France ORCID (unauthenticated)
-
Freddie Illingworth Department of Mathematics University College London London UK ORCID (unauthenticated)
-
Rose McCarty Department of Mathematics Princeton University Princeton New Jersey USA ORCID (unauthenticated)
Abstract
Cite
Blanco, Pablo, et al. “On Tree Decompositions Whose Trees Are Minors”. Journal of Graph Theory, vol. 106, no. 2, 2024, pp. 296-0, https://doi.org/10.1002/jgt.23083.
Blanco, P., Cook, L., Hatzel, M., Hilaire, C., Illingworth, F., & McCarty, R. (2024). On tree decompositions whose trees are minors. Journal of Graph Theory, 106(2), 296-306. https://doi.org/10.1002/jgt.23083
Blanco, Pablo, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, and Rose McCarty. “On Tree Decompositions Whose Trees Are Minors”. Journal of Graph Theory 106, no. 2 (2024): 296-306. https://doi.org/10.1002/jgt.23083.
Blanco P, Cook L, Hatzel M, Hilaire C, Illingworth F, McCarty R. On tree decompositions whose trees are minors. Journal of Graph Theory. 2024;106(2):296-30.
Journal Category
Science
Mathematics
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Tight Bound on Treedepth in Terms of Pathwidth and Longest Path | Combinatorica |
| 1 | 2023 |
| Treedepth vs Circumference | Combinatorica |
| 2 | 2023 |
| Midsummer Combinatorial Workshop Prague | 2012 | |||
| 10.1007/978-3-642-27875-4_6 | ||||
Some results on tree decomposition of graphs | Journal of Graph Theory |
| 20 | 1995 |