On the Number of Minimum Size Separating Vertex Sets in a Graph

Kanevsky, Arkady

Permalink

https://hdl.handle.net/2142/100021 Copy

Description

Title

On the Number of Minimum Size Separating Vertex Sets in a Graph

Author(s)

Kanevsky, Arkady

Issue Date

1987-07

Keyword(s)

• Connectivity
• Undirected k-connected graph
• Vertex sets

Publisher

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG-87-2243, ACT-80

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/100021

Sponsor(s)/Grant Number(s)

• National Science Foundation / ECS 84-10902 and 8404866
• Semiconductor Research Corporation / 86-12-109
• Joint Services Electronics Program / JSEP N00014-84-C-0149

Owning Collections