Skip to main content
SpringerLink
Log in

On the length of longest chordless cycles

  • Regular
  • Published:
4OR Aims and scope Submit manuscript

Abstract.

Upper bounds for the length of a longest (circuit) cycle without chords in a (directed) graph are given in terms of the rank of the adjacency matrix and in terms of its eigenvalues.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Antwerp, Prinsstraat 13, 2000, Antwerp, Belgium

    Cyriel Van Nuffelen & Kristel Van Rompay

Authors
  1. Cyriel Van Nuffelen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kristel Van Rompay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cyriel Van Nuffelen.

Additional information

Received: October 2003, Revised: January 2005,

AMS classification:

05C

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nuffelen, C.V., Rompay, K.V. On the length of longest chordless cycles. 4OR 3, 133–138 (2005). https://doi.org/10.1007/s10288-005-0062-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-005-0062-1

Keywords:

Search

Navigation