Completely Disconnecting the Complete Graph

DOI10.1137/S0895480197326553MaRDI QIDQ4943702zbMATH OpenOpenAlexFDO

Authors J. Ginsburg, Bill Sands

Publication date 19 March 2000

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480197326553

zbMATH Keywords

complete graphedge deletion

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Proper disconnection of graphs
• Detachments of Complete Graphs
• Disconnecting graphs by removing vertices: a polyhedral approach
• Entire graphs
• Graph connectivity after path removal
• Disconnecting strongly regular graphs
• The disconnection number of a graph
• Monochromatic disconnection of graphs
• On the complete digraphs which are simply disconnected
• The acyclic disconnection of a digraph

Cited in

(1)

• The disconnection number of a graph

This page was built for publication: Completely Disconnecting the Complete Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943702)