scientific article; zbMATH DE number 15867

MaRDI QIDQ3972517zbMATH OpenFDO

Authors Markus Fulmek, Herbert Fleischner

Publication date 25 June 1992

zbMATH Keywords

digraphsEulerian trailssplitting away arcssplitting lemma

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 15460
• Digraph Decompositions and Eulerian Systems
• Packing Digraphs with Directed Closed Trails
• Spanning eulerian subdigraphs in semicomplete digraphs
• scientific article; zbMATH DE number 1947434

Cited in

(12)

• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
• Almost Eulerian compatible spanning circuits in edge-colored graphs
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
• Circular flows of nearly Eulerian graphs and vertex-splitting
• scientific article; zbMATH DE number 4162907 (Why is no real title available?)
• Digraph Decompositions and Eulerian Systems
• scientific article; zbMATH DE number 1947434 (Why is no real title available?)
• Nowhere‐zero 3‐flows in products of graphs
• Compatible spanning circuits and forbidden induced subgraphs
• Transforming eulerian trails
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs

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