What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?

DOI10.1002/JGT.3190100307MaRDI QIDQ3745872zbMATH OpenOpenAlexFDO

Authors Nathaniel Dean

Publication date 1986

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190100307

zbMATH Keywords

cycle decompositionEulerian directed graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4091535
• scientific article; zbMATH DE number 4061286
• Long cycles, heavy cycles and cycle decompositions in digraphs
• scientific article; zbMATH DE number 147647
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles

Cites work

• Graph theory with applications
• Partitions of digraphs into paths or circuits
• The Representation of a Graph by Set Intersections

Cited in

(9)

• On some unsolved and solved problems in the theory of directed graphs. I
• scientific article; zbMATH DE number 147647 (Why is no real title available?)
• Towards the Erdős-Gallai cycle decomposition conjecture
• Long cycles, heavy cycles and cycle decompositions in digraphs
• On covers of graphs
• Towards the Erdős-Gallai cycle decomposition conjecture
• Small cycle double covers of 4-connected planar graphs
• Hajós' conjecture and small cycle double covers of planar graphs
• Path and cycle decompositions of dense graphs

This page was built for publication: What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?

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