scientific article
From MaRDI portal
Publication:3032280
zbMath0691.05026MaRDI QIDQ3032280
Michael R. Fellows, Sam Stueckle
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (14)
Edge vulnerability parameters of split graphs ⋮ Some operations in hub-integrity of graphs ⋮ Safe number and integrity of graphs ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Computational complexity of network vulnerability analysis ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ Link Vulnerability in Networks ⋮ Parameterized complexity of critical node cuts ⋮ A survey of integrity ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ Edge vulnerability parameters of bisplit graphs ⋮ Unnamed Item ⋮ Edge-integrity: A survey ⋮ On the edge-integrity of some graphs and their complements
This page was built for publication:
