Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Algebraic Algorithms for Even Circuits in Graphs

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read More Add to Saved list
  • Additional Information
    • Publication Information:
      Multidisciplinary Digital Publishing Institute
    • Publication Date:
      2021
    • Collection:
      Texas State University: Digital Collections Repository
    • Abstract:
      We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs. ; Mathematics
    • File Description:
      Text; 18 pages; 1 file (.pdf); application/pdf
    • ISSN:
      2227-7390
    • Relation:
      Hà, H. T., & Morey, S. (2019). Algebraic algorithms for even circuits in graphs. Mathematics, 7(9): 859.; https://digital.library.txstate.edu/handle/10877/13833; https://doi.org/10.3390/math7090859
    • Accession Number:
      10.3390/math7090859
    • Online Access:
      https://doi.org/10.3390/math7090859
      https://digital.library.txstate.edu/handle/10877/13833
    • Rights:
      © 2019 The Authors. ; This work is licensed under a Creative Commons Attribution 4.0 International License.
    • Accession Number:
      edsbas.84FBD697