scientific article; zbMATH DE number 7075896
From MaRDI portal
Publication:4967194
zbMath1409.68207MaRDI QIDQ4967194
Publication date: 3 July 2019
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/362/344
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items (6)
Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Vulnerability of subclasses of chordal graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Toughness, forbidden subgraphs, and Hamilton-connected graphs
This page was built for publication:
