An efficient algorithm to compute the toughness in graphs with bounded treewidth
type: Item
instance of: scholarly article
title: An efficient algorithm to compute the toughness in graphs with bounded treewidth
zbMATH Open document ID: 1548.05189
author: Gyula Y. Katona
author: Humara Khan
published in: Graphs and Combinatorics
publication date: 2024-10-09T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7923968
zbMATH Keywords: tougness
zbMATH Keywords: fixed-parameter tractable
zbMATH Keywords: treewidth
MaRDI profile type: MaRDI publication profile
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Recognizing tough graphs is NP-hard
cites work: On the complexity of recognizing tough graphs
cites work: The complexity of recognizing tough cubic graphs
cites work: Q4489197
cites work: Q3003675
cites work: Q4291429
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: The Fine Details of Fast Dynamic Programming over Tree Decompositions
cites work: Q4967194
cites work: On Toughness and Hamiltonicity of 2K2‐Free Graphs
cites work: Tough graphs and Hamiltonian circuits.
cites work: Computations by fly-automata beyond monadic second-order logic
cites work: Parameterized Algorithms
cites work: Q4326197
cites work: Toughness, hamiltonicity and split graphs
cites work: Hamiltonian results inK1,3-free graphs
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: The toughness of split graphs
DOI: 10.1007/S00373-024-02828-Y
description: scientific article; zbMATH DE number 7923968