Document Open Access Logo

Separating Geodesic Structure and Product Structure

Authors Laura Merker , Lena Scherzer , Samuel Schneider

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2026.126.pdf
  • Filesize: 1.36 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
  • Mathematics of computing → Graph algorithms
Keywords
  • product structure
  • row treewidth
  • geodesic structure
  • geodesic treewidth

Metrics

Abstract

The geodesic treewidth of a graph G is the smallest k for which there is a partition 𝒫 into geodesics such that G/𝒫 has treewidth k, where G/𝒫 is obtained from G by contracting each part of 𝒫. Based on this notion, row treewidth was developed and is defined for a graph G as the smallest k such that G ⊆ H ⊠ P for some graph H of treewidth k and a path P. Equivalently, the row treewidth of a graph G is the smallest k for which there is a partition 𝒫 into disjoint unions of geodesics that are aligned with respect to some layering such that G/𝒫 has treewidth k.
We separate the two notions by showing that bounded row treewidth does not imply bounded geodesic treewidth and by presenting a polynomial-time algorithm to decide whether a graph of treewidth 2 has geodesic treewidth 1, which is known to be NP-hard for row treewidth [Biedl, Eppstein, Ueckerdt, 2025]. More generally, we provide an algorithm to decide whether a given graph has geodesic treewidth at most d that is XP in the treewidth, whereas there is no such algorithm for row treewidth, unless P = NP [Biedl, Eppstein, Ueckerdt, 2025]. On the other hand, we show that computing the geodesic treewidth is NP-hard and that every graph with geodesic treewidth 1 has bounded row treewidth. Moreover, we improve the best known lower bound on the geodesic treewidth of planar graphs to 5.

Cite As Get BibTex

Laura Merker, Lena Scherzer, and Samuel Schneider. Separating Geodesic Structure and Product Structure. In 34th Annual European Symposium on Algorithms (ESA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 388, pp. 126:1-126:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ESA.2026.126

Author Details

Laura Merker
  • Karlsruhe Institute of Technology, Germany
Lena Scherzer
  • University of Hamburg, Germany
Samuel Schneider
  • Karlsruhe Institute of Technology, Germany

References

  1. Isolde Adler, Martin Grohe, and Stephan Kreutzer. Computing excluded minors. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '08, pages 641-650, USA, 2008. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=1347082.1347153.
  2. Shinwoo An, Seonghyuk Im, Seokbeom Kim, and Myounghwan Lee. An efficient algorithm for ℱ-subgraph-free edge deletion on graphs having a product structure, 2025. URL: https://doi.org/10.48550/arXiv.2510.14674.
  3. Stefan Arnborg, Andrzej Proskurowski, and Derek G. Corneil. Forbidden minors characterization of partial 3-trees. Discrete Mathematics, 80(1):1-19, 1990. URL: https://doi.org/10.1016/0012-365X(90)90292-P.
  4. Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný, and Michael Kaufmann. Graph product structure for h-framed graphs. The Electronic Journal of Combinatorics, pages P4-55, 2024. URL: https://doi.org/10.37236/12123.
  5. Michael A. Bekos, Martin Gronemann, and Chrysanthi N. Raftopoulou. An Improved Upper Bound on the Queue Number of Planar Graphs. Algorithmica, 85:544-562, February 2023. URL: https://doi.org/10.1007/s00453-022-01037-4.
  6. Therese Biedl, David Eppstein, and Torsten Ueckerdt. On the complexity of embedding in graph products. Computing in Geometry and Topology, 4(2):5:1-5:18, May 2025. URL: https://doi.org/10.57717/cgt.v4i2.56.
  7. Thomas Bläsius, Emil Dohse, Deborah Haun, and Laura Merker. Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs. In Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri, editors, 42nd International Symposium on Computational Geometry (SoCG 2026), volume 367 of Leibniz International Proceedings in Informatics (LIPIcs), pages 18:1-18:17, Dagstuhl, Germany, 2026. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2026.18.
  8. Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1):1-45, 1998. URL: https://doi.org/10.1016/S0304-3975(97)00228-4.
  9. Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter Labeling Schemes for Planar Graphs. SIAM Journal on Discrete Mathematics, 36(3):2082-2099, September 2022. Publisher: Society for Industrial and Applied Mathematics. URL: https://doi.org/10.1137/20M1330464.
  10. Édouard Bonnet, O-joung Kwon, and David R. Wood. Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond). Journal of Combinatorial Theory, Series B, 178:27-66, 2026. URL: https://doi.org/10.1016/j.jctb.2025.11.010.
  11. Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, Pat Morin, and David R. Wood. Separating layered treewidth and row treewidth. Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1(Graph Theory), May 2022. URL: https://doi.org/10.46298/dmtcs.7458.
  12. Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, and Pat Morin. Asymptotically optimal vertex ranking of planar graphs, 2020. URL: https://doi.org/10.48550/arXiv.2007.06455.
  13. Prosenjit Bose, Pat Morin, and Saeed Odak. An Optimal Algorithm for Product Structure in Planar Graphs. In Artur Czumaj and Qin Xin, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), volume 227 of Leibniz International Proceedings in Informatics (LIPIcs), pages 19:1-19:14, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SWAT.2022.19.
  14. Michał Dębski, Piotr Micek, Felix Schröder, and Stefan Felsner. Improved bounds for centered colorings. Advances in Combinatorics, August 2021. URL: https://doi.org/10.19086/aic.27351.
  15. Marc Distel, Robert Hickingbotham, Michał T. Seweryn, and David R. Wood. Powers of planar graphs, product structure, and blocking partitions. Innovations in Graph Theory, 1:39-86, 2024. URL: https://doi.org/10.5802/igt.4.
  16. Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, and Pat Morin. Adjacency labelling for planar graphs (and beyond). J. ACM, 68(6), October 2021. URL: https://doi.org/10.1145/3477542.
  17. Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, and David R. Wood. Planar graphs have bounded nonrepetitive chromatic number. Advances in Combinatorics, March 2020. URL: https://doi.org/10.19086/aic.12100.
  18. Vida Dujmović, Louis Esperet, Pat Morin, and David R. Wood. Proof of the clustered hadwiger conjecture. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1921-1930, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00116.
  19. Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. J. ACM, 67(4), August 2020. URL: https://doi.org/10.1145/3385731.
  20. Vida Dujmović, Pat Morin, and Saeed Odak. Odd colourings of graph products, 2022. URL: https://doi.org/10.48550/arXiv.2202.12882.
  21. Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, and David R. Wood. Clustered 3-colouring graphs of bounded degree. Combinatorics, Probability and Computing, 31(1):123-135, 2022. URL: https://doi.org/10.1017/S0963548321000213.
  22. Vida Dujmović, Pat Morin, and David R. Wood. Graph product structure for non-minor-closed classes. Journal of Combinatorial Theory, Series B, 162:34-67, 2023. URL: https://doi.org/10.1016/j.jctb.2023.03.004.
  23. Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, and Torsten Ueckerdt. On comparable box dimension. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:14, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2022.38.
  24. Louis Esperet, Gwenaël Joret, and Pat Morin. Sparse universal graphs for planarity. Journal of the London Mathematical Society, 108(4):1333-1357, 2023. URL: https://doi.org/10.1112/jlms.12781.
  25. Miriam Goetze, Fabian Klute, Kolja Knauer, Irene Parada, Juan Pablo Peña, and Torsten Ueckerdt. Strong odd coloring in minor-closed classes, 2025. URL: https://doi.org/10.48550/arXiv.2505.02736.
  26. Kevin Hendrey, Nikolai Karol, and David R. Wood. Structure of k-matching-planar graphs, 2025. URL: https://doi.org/10.48550/arXiv.2507.22395.
  27. Robert Hickingbotham, Paul Jungeblut, Laura Merker, and David R. Wood. The product structure of squaregraphs. Journal of Graph Theory, 105(2):179-191, 2024. URL: https://doi.org/10.1002/jgt.23008.
  28. Robert Hickingbotham and David R. Wood. Shallow minors, graph products, and beyond-planar graphs. SIAM Journal on Discrete Mathematics, 38(1):1057-1089, 2024. URL: https://doi.org/10.1137/22M1540296.
  29. Gwenaël Joret and Clément Rambaud. Neighborhood complexity of planar graphs. Combinatorica, 44(5):1115-1148, 2024. URL: https://doi.org/10.1007/s00493-024-00110-6.
  30. Daniel Kráľ, Kristýna Pekárková, and Kenny Štorgel. Twin-Width of Graphs on Surfaces. In Rastislav Královič and Antonín Kučera, editors, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), volume 306 of Leibniz International Proceedings in Informatics (LIPIcs), pages 66:1-66:15, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.66.
  31. Jens Lagergren. Upper bounds on the size of obstructions and intertwines. Journal of Combinatorial Theory, Series B, 73(1):7-40, 1998. URL: https://doi.org/10.1006/jctb.1997.1788.
  32. Laura Merker, Lena Scherzer, and Samuel Schneider. Separating geodesic structure and product structure, 2026. URL: https://arxiv.org/abs/2607.02098v1.
  33. Pat Morin. A fast algorithm for the product structure of planar graphs. Algorithmica, 83(5):1544-1558, 2021. URL: https://doi.org/10.1007/S00453-020-00793-5.
  34. Michał Pilipczuk and Sebastian Siebertz. Polynomial bounds for centered colorings on proper minor-closed graph classes. Journal of Combinatorial Theory, Series B, 151:111-147, 2021. URL: https://doi.org/10.1016/j.jctb.2021.06.002.
  35. A. Satyanarayana and L. Tung. A characterization of partial 3-trees. Networks, 20(3):299-322, 1990. URL: https://doi.org/10.1002/net.3230200304.
  36. Craig A. Tovey. A simplified np-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85-89, 1984. URL: https://doi.org/10.1016/0166-218X(84)90081-7.
  37. Torsten Ueckerdt, David R. Wood, and Wendy Yi. An improved planar graph product structure theorem. The Electronic Journal of Combinatorics, pages P2-51, 2022. URL: https://doi.org/10.37236/10614.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact