Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Extremal Results on Arc-Traceable Tournaments

Arthur H. Busch1, Michael S. Jacobson1
1Department of Mathematics University of Colorado at Denver Denver, CO 80217
  • Published: 30/11/2007

Abstract

We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs \( G_{m,n} \). The bound is within \( 5 \) of a known upper bound that has been conjectured to be the exact domination number of the complete grid graphs.

Keywords: Tournament, Hamiltonian path Mathematics Subject Classifications: 05C20, 05C38
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Arthur H. Busch, Michael S. Jacobson. Extremal Results on Arc-Traceable Tournaments[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 063. 3-15. DOI: .