Tools for studying paths and cycles in digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199803)31:2<125::AID-NET7>3.0.CO;2-J" /><125::AID-NET7>3.0.CO;2-J 10.1002/(SICI)1097-0037(199803)31:2<125::AID-NET7>3.0.CO;2-JzbMath0930.05059OpenAlexW2016353902MaRDI QIDQ4260018

Domingo Quiroz, Oscar Ordaz, Charles Delorme

Publication date: 22 November 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199803)31:2<125::aid-net7>3.0.co;2-j

zbMATH Keywords

pathsdigraphscircuitsknowledge base

Mathematics Subject Classification ID

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

Related Items (1)

Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian

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