What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
From MaRDI portal
Publication:3745872
DOI10.1002/jgt.3190100307zbMath0607.05049MaRDI QIDQ3745872
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Hajós' conjecture and small cycle double covers of planar graphs, Small cycle double covers of 4-connected planar graphs, On covers of graphs, Long cycles, heavy cycles and cycle decompositions in digraphs, Path and cycle decompositions of dense graphs
Cites Work