Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Blocking Sets for Paths of a Given Length

Paul Erdés1, Ralph Faudree2, Edward T. Ordman2, Cecil Rousseau2, Richard Schelp 2
1 Hungarian Academy of Sciences
2Department of Mathematical Sciences The University of Memphis Memphis, Tennessee 38152-3240
  • Published: 28/02/2002

Abstract

How many vertices must we delete from a graph so that it no longer contains a path \(P_k\) on \(k\) vertices? We explore this question for various special graphs (hypercubes, square lattice graphs) as well as for some general families.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Paul Erdés, Ralph Faudree, Edward T. Ordman, Cecil Rousseau, Richard Schelp . Blocking Sets for Paths of a Given Length[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 040. 65-78. DOI: .