scientific article; zbMATH DE number 1947434

MaRDI QIDQ4411403zbMATH OpenFDO

Authors Jana Maxová, J. Nešetřil

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610711.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Transforming eulerian trails
• Digraph Decompositions and Eulerian Systems
• scientific article; zbMATH DE number 15867
• Compatible Euler tours and supplementary Eulerian vectors
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs

Cited in

(6)

• Two-factors in orientated graphs with forbidden transitions
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• Compatible Eulerian circuits in \(K_ n^{**}\)
• scientific article; zbMATH DE number 15867 (Why is no real title available?)
• Transforming eulerian trails
• On the Query Complexity of Testing Orientations for Being Eulerian

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