scientific article
From MaRDI portal
Publication:3782804
zbMath0641.68098MaRDI QIDQ3782804
Publication date: 1987
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)
Related Items (3)
Toughness, hamiltonicity and split graphs ⋮ Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
