English

Spanning tree congestion of proper interval graphs

Data Structures and Algorithms 2026-02-17 v1
Authors: Yota Otachi
View on arXiv ↗ PDF ↗

Abstract

We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.

Keywords

planar graph drawing graph algorithms

Cite

@article{arxiv.2602.13756,
  title  = {Spanning tree congestion of proper interval graphs},
  author = {Yota Otachi},
  journal= {arXiv preprint arXiv:2602.13756},
  year   = {2026}
}

Comments

10 pages, 2 figures

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Parameterized Spanning Tree Congestion
Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi +2
2026-05-28
Computational Complexity · Computer Science
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
Huong Luu, Marek Chrobak
2023-07-12
Data Structures and Algorithms · Computer Science
Two Complexity Results on Spanning-Tree Congestion Problems
Sunny Atalig, Marek Chrobak, Christoph Dürr, Petr Kolman +3
2026-02-12
Discrete Mathematics · Computer Science
The Maximum Clique Problem in Multiple Interval Graphs
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012-03-12
Data Structures and Algorithms · Computer Science
Approximation of Spanning Tree Congestion using Hereditary Bisection
Petr Kolman
2026-05-05
Data Structures and Algorithms · Computer Science
Spanning Trees with a Small Vertex Cover: the Complexity on Specific Graph Classes
Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura +1
2025-12-01
Discrete Mathematics · Computer Science
On spanning tree congestion of Hamming graphs
Kyohei Kozawa, Yota Otachi
2011-10-18
Discrete Mathematics · Computer Science
Minimal $L^p$-congestion spanning trees on weighted graphs
Alberto Castejón Lafuente, Emilio Estévez, Carlos Meniño Cotón, M. Carmen Somoza
2025-05-12
Combinatorics · Mathematics
Four NP-complete problems about generalizations of perfect graphs
Vaidy Sivaraman
2017-05-18
Data Structures and Algorithms · Computer Science
On the Clique-Width of Unigraphs
Yu Nakahata
2022-02-01
Combinatorics · Mathematics
1-skeletons of the spanning tree problems with additional constraints
Vladimir Bondarenko, Andrei Nikolaev, Dzhambolet Shovgenov
2018-02-16
Computational Complexity · Computer Science
Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
Alexey Barsukov, Bodhayan Roy
2024-04-25
Discrete Mathematics · Computer Science
On the complete width and edge clique cover problems
Van Bang Le, Sheng-Lung Peng
2016-12-28
Data Structures and Algorithms · Computer Science
Spanning Tree Congestion and Computation of Generalized Gy\H{o}ri-Lov\'{a}sz Partition
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
2018-04-26
Computational Complexity · Computer Science
Maximum cut on interval graphs of interval count four is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira, Ana Silva
2022-11-30
Combinatorics · Mathematics
Some NP-complete edge packing and partitioning problems in planar graphs
Jed Yang
2014-09-09
Combinatorics · Mathematics
The minimum stretch spanning tree problem for typical graphs
Lan Lin, Yixun Lin
2017-12-12
Combinatorics · Mathematics
Minimum congestion spanning trees in planar graphs
M. I. Ostrovskii
2010-09-07
Data Structures and Algorithms · Computer Science
Binary weights spanning trees and the $k$-red spanning tree problem in linear time
Dorit S. Hochbaum
2024-01-17
Combinatorics · Mathematics
Alternative proof of upper bound of spanning trees in a graph
K. V. Chelpanov
2022-12-01
Combinatorics · Mathematics
Coloring problem of signed interval graphs
F. Ramezani
2019-07-23
Data Structures and Algorithms · Computer Science
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta +3
2022-01-13
Combinatorics · Mathematics
Independent sets in edge-clique graphs
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
2012-06-12
Combinatorics · Mathematics
Spanning trees in connected graphs with few branch and end vertices
Zhora Nikoghosyan
2015-05-19
Combinatorics · Mathematics
Blockers for non-crossing spanning trees in complete geometric graphs
Chaya Keller, Micha A. Perles, Eduardo Rivera-Campo, Virginia Urrutia-Galicia
2012-01-24
R2 v1 2026-07-01T10:36:50.517Z