Completely Disconnecting the Complete Graph
type: Item
instance of: scholarly article
title: Completely Disconnecting the Complete Graph
zbMATH Open document ID: 0946.05079
DOI: 10.1137/S0895480197326553
author: J. Ginsburg
author: Bill Sands
published in: SIAM Journal on Discrete Mathematics
publication date: 2000-03-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1416928
zbMATH Keywords: complete graph
zbMATH Keywords: edge deletion
MaRDI profile type: MaRDI publication profile
full work available at URL: s0895480197326553
OpenAlex ID: W2061423678
Recommended article: Proper disconnection of graphs
Recommended article: Detachments of Complete Graphs
Recommended article: Disconnecting graphs by removing vertices: a polyhedral approach
Recommended article: Entire graphs
Recommended article: Graph connectivity after path removal
Recommended article: Disconnecting strongly regular graphs
Recommended article: The disconnection number of a graph
Recommended article: Monochromatic disconnection of graphs
Recommended article: On the complete digraphs which are simply disconnected
Recommended article: The acyclic disconnection of a digraph
description: scientific article; zbMATH DE number 1416928