Tight Bound on Treedepth in Terms of Pathwidth and Longest Path

Article Properties
  • Language
    English
  • DOI (url)
    10.1007/s00493-023-00077-w
  • Publication Date
    2023/12/19
  • Journal
    Combinatorica
  • Indian UGC (journal)
  • Refrences
    9
  • Citations
    1
  • Meike Hatzel
  • Gwenaël Joret
  • Piotr Micek
  • Marcin Pilipczuk
  • Torsten Ueckerdt
  • Bartosz Walczak
Cite
Hatzel, Meike, et al. “Tight Bound on Treedepth in Terms of Pathwidth and Longest Path”. Combinatorica, vol. 44, no. 2, 2023, pp. 417-2, https://doi.org/10.1007/s00493-023-00077-w.
Hatzel, M., Joret, G., Micek, P., Pilipczuk, M., Ueckerdt, T., & Walczak, B. (2023). Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Combinatorica, 44(2), 417-427. https://doi.org/10.1007/s00493-023-00077-w
Hatzel, Meike, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, and Bartosz Walczak. “Tight Bound on Treedepth in Terms of Pathwidth and Longest Path”. Combinatorica 44, no. 2 (2023): 417-27. https://doi.org/10.1007/s00493-023-00077-w.
Hatzel M, Joret G, Micek P, Pilipczuk M, Ueckerdt T, Walczak B. Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Combinatorica. 2023;44(2):417-2.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
A polynomial excluded-minor approximation of treedepth Journal of the European Mathematical Society
  • Science: Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2 2022
10.1016/0095-8956(91)90068-U 1991
Graph minors. V. Excluding a planar graph Journal of Combinatorial Theory, Series B
  • Science: Mathematics
 288 1986
10.1007/978-3-642-27875-4
Approximating Pathwidth for Graphs of Small Treewidth

 ACM Transactions on Algorithms
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1 2023
Citations
Title Journal Journal Categories Citations Publication Date
On tree decompositions whose trees are minors

 Journal of Graph Theory
  • Science: Mathematics
 2024
Citations Analysis
Category Category Repetition
Science: Mathematics1
The category Science: Mathematics 1 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On tree decompositions whose trees are minors and was published in 2024. The most recent citation comes from a 2024 study titled On tree decompositions whose trees are minors. This article reached its peak citation in 2024, with 1 citations. It has been cited in 1 different journals. Among related journals, the Journal of Graph Theory cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year