scientific article; zbMATH DE number 3946164

MaRDI QIDQ3717077zbMATH OpenFDO

Authors Dǎnuţ Marcu

Publication date 1985

zbMATH Keywords

algorithmEulerian circuitsEulerian pathsfinite digraphFORTRAN program

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Enumeration of Hamiltonian circuits in digraphs
• Euler digraphs
• Two arc disjoint paths in Eulerian digraphs
• Computing Eulerian trails
• An Eulerian exposition

Cited in

(17)

• On non-intersecting Eulerian circuits
• Computing Eulerian trails
• On a formula for the number of Euler trails for a class of digraphs
• A compact form of assignment of all nonexcessive paths in a digraph
• An alternative formula for the number of Euler trails for a class of digraphs
• Note on long paths in Eulerian digraphs
• scientific article; zbMATH DE number 6379051 (Why is no real title available?)
• Enumeration of Hamiltonian circuits in digraphs
• scientific article; zbMATH DE number 5831723 (Why is no real title available?)
• scientific article; zbMATH DE number 4145933 (Why is no real title available?)
• Minimal Eulerian Circuit in a Labeled Digraph
• A new algorithm to find all elementary circuits of a directed graph
• scientific article; zbMATH DE number 3914345 (Why is no real title available?)
• scientific article; zbMATH DE number 3922696 (Why is no real title available?)
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• scientific article; zbMATH DE number 3974985 (Why is no real title available?)
• Finding Euler tours in parallel

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 Q3717077)