Completely Disconnecting the Complete Graph

DOI10.1137/S0895480197326553zbMATH Open0946.05079OpenAlexW2061423678MaRDI QIDQ4943702FDOQ4943702

Bill Sands, J. Ginsburg

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

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

Recommendations

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

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)