scientific article; zbMATH DE number 867714
From MaRDI portal
Publication:4873831
zbMath0840.05043MaRDI QIDQ4873831
Publication date: 22 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
characterizationconnectivityextremal problemstoughnessintegrityNordhaus-Gaddumbinding numbermaximal graphscut-set
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (6)
The complexity of recognizing tough cubic graphs ⋮ Measures of vulnerability–the integrity family ⋮ Extreme tenacity of graphs with given order and size ⋮ A survey of integrity ⋮ Toughness in graphs -- a survey ⋮ Unnamed Item
This page was built for publication:
