scientific article; zbMATH DE number 2077649

MaRDI QIDQ4472691zbMATH OpenFDO

Authors A. Gregory Starling, Joseph B. Klerlein, Jacob Kier, Edward C. Carr

Publication date 1 July 2004

zbMATH Keywords

algorithmcircular stringcosetdirected cyclevertex-transitive digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 147652
• Some remarks on cycles in graphs and digraphs
• Almost given length cycles in digraphs
• Cycles in graphs and related problems
• The k-dominating cycles in graphs
• Cycles in dense digraphs
• scientific article; zbMATH DE number 1247175
• An efficient approximation algorithm for counting \(n\)-cycles in a graph
• A numerical approach to long cycles in graphs and digraphs
• A note on short cycles in digraphs

Cited in

(5)

• Digraphs on permutations
• Hamiltonicity of digraphs for universal cycles of permutations
• scientific article; zbMATH DE number 4014753 (Why is no real title available?)
• scientific article; zbMATH DE number 1933268 (Why is no real title available?)
• Parameterized Algorithms for List K-Cycle

This page was built for publication:

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