Image de couverture de livre

Determining the Outerthickness of Graphs Is NP-Hard

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Pin-Hsian, Liu, Te-Cheng, Tsai, Meng-Tsung
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hardness of Finding Kings and Strong Kings
par: Alaoui, Ziad Ismaili, et autres
Publié: (2025)

Reconfiguring Graph Homomorphisms on the Sphere
par: Lee, Jae-Baek, et autres
Publié: (2018)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)

Graph Irregularity via Edge Deletions
par: Bensmail, Julien, et autres
Publié: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

On Computational Aspects of Cores of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

Testing Isomorphism of Graphs in Polynomial Time
par: Xue, Rui
Publié: (2023)

Finding d-Cuts in Claw-free Graphs
par: Ahn, Jungho, et autres
Publié: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
par: Concha-Vega, Pablo
Publié: (2026)

Finding Minimum Matching Cuts in $H$-free Graphs
par: Lucke, Felicia, et autres
Publié: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
par: Lucke, Felicia
Publié: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
par: Kurapov, Sergey, et autres
Publié: (2024)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
par: Hellmuth, Marc, et autres
Publié: (2023)

On the complexity of the Maker-Breaker happy vertex game
par: Hilaire, Mathieu, et autres
Publié: (2026)

On the parameterized complexity of the Maker-Breaker domination game
par: Bagan, Guillaume, et autres
Publié: (2026)

A Simple Sub-Polynomial Degree Coboundary Expander
par: Hopkins, Max, et autres
Publié: (2026)

Sparse High Dimensional Expanders via Local Lifts
par: Yaacov, Inbar Ben, et autres
Publié: (2024)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
par: Bok, Jan, et autres
Publié: (2021)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

Factorization norms and an inverse theorem for MaxCut
par: Balla, Igor, et autres
Publié: (2025)

Maker-Maker games of rank 4 are PSPACE-complete
par: Galliot, Florian, et autres
Publié: (2025)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
par: Kutner, David C., et autres
Publié: (2023)

On full-separating sets and related codes in graphs
par: Chakraborty, Dipayan, et autres
Publié: (2024)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
par: Chang, Fan, et autres
Publié: (2025)

Combinatorial refinement on circulant graphs
par: Kluge, Laurence
Publié: (2022)

Chernoff Bounds and Reverse Hypercontractivity on HDX
par: Dikstein, Yotam, et autres
Publié: (2024)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
par: Kopparty, Swastik, et autres
Publié: (2023)

Atropos-k is PSPACE-complete
par: Yang, Chao, et autres
Publié: (2024)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
par: Caragiannis, Ioannis, et autres
Publié: (2024)

Approximate cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2025)

A Linear Kernel for Planar Vector Domination
par: Sahili, Mahabba El, et autres
Publié: (2023)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Structural Origins of Cubic Complexity in Pebble Motion
par: Nakamigawa, Tomoki, et autres
Publié: (2025)

Hierarchies of Minion Tests for PCSPs through Tensors
par: Ciardo, Lorenzo, et autres
Publié: (2022)

On Computational Aspects of Ordered Matching Problems
par: Čertík, Michal, et autres
Publié: (2025)

More efficient sifting for grid norms, and applications to multiparty communication complexity
par: Kelley, Zander, et autres
Publié: (2025)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
par: Galliot, Florian
Publié: (2025)

On the hardness of recognizing graphs of small mim-width and its variants
par: la Tour, Max Dupré, et autres
Publié: (2025)

Complexity results for a cops and robber game on directed graphs
par: Ben-Ameur, Walid, et autres
Publié: (2024)