Branch-depth: Generalizing tree-depth of graphs

DeVos, M., Kwon, O., & Oum, S. (2020). Branch-depth: Generalizing tree-depth of graphs. European Journal of Combinatorics, 90, 103186. https://doi.org/10.1016/j.ejc.2020.103186

DeVos, Matt, et al. “Branch-depth: Generalizing tree-depth of graphs.” European Journal of Combinatorics, vol. 90, 2020, p. 103186, https://doi.org/10.1016/j.ejc.2020.103186.

DeVos, Matt, O‐joung Kwon, and Sang‐il Oum. 2020. “Branch-depth: Generalizing tree-depth of graphs.” European Journal of Combinatorics 90: 103186. https://doi.org/10.1016/j.ejc.2020.103186.

DeVos, M., Kwon, O. and Oum, S. (2020) ‘Branch-depth: Generalizing tree-depth of graphs’, European Journal of Combinatorics, 90, p. 103186. Available at: https://doi.org/10.1016/j.ejc.2020.103186.

@article{devos2020branch,
  title = {{Branch-depth: Generalizing tree-depth of graphs}},
  author = {DeVos, Matt and Kwon, O‐joung and Oum, Sang‐il},
  journal = {European Journal of Combinatorics},
  volume = {90},
  pages = {103186},
  year = {2020},
  doi = {10.1016/j.ejc.2020.103186}
}