Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Cutting a Graph into Small Components

Miranca Fischermann1, Dieter Rautenbach1, Lutz Volkmann1
1Lehrstuhl II fiir Mathematik, RWTH-Aachen, 52056 Aachen, Germany
  • Published: 29/02/2004

Abstract

For some fixed \( n_0 \geq 0 \), we study the minimum number of vertices or edges that have to be removed from a graph such that no component of the rest has more than \( n_0 \) vertices.

Keywords: cut; centroid; median; separator
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann. Cutting a Graph into Small Components[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 048. 217-222. DOI: .