Tools for studying paths and cycles in digraphs

DOI10.1002/(SICI)1097-0037(199803)31:2%3C125::AID-NET7%3E3.0.CO;2-JMaRDI QIDQ4260018zbMATH OpenOpenAlexFDO

Authors C. Delorme, Oscar Ordaz, Domingo Quiroz

Publication date 22 November 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199803)31:2%3C125::aid-net7%3E3.0.co;2-j

zbMATH Keywords

circuitsdigraphsknowledge basepaths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Cited in

(2)

• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Tools for counting odd cycles in graphs

This page was built for publication: Tools for studying paths and cycles in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260018)