Packing Digraphs with Directed Closed Trails

DOI10.1017/S0963548302005461zbMath1015.05072OpenAlexW2018732791MaRDI QIDQ4796722

Paul N. Balister

Publication date: 15 July 2003

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005461

zbMATH Keywords

Eulerian digraphedge-decompositioncomplete multigraphcomplete directed graph(directed) closed trail

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Packing directed cycles efficiently ⋮ Edge-disjoint open trails in complete bipartite multigraphs ⋮ Walks, partitions, and normal ordering ⋮ Approximability of Packing Disjoint Cycles ⋮ Approximability of packing disjoint cycles ⋮ Closed trail decompositions of complete equipartite graphs ⋮ On planar graphs arbitrarily decomposable into closed trails ⋮ Decomposition of bipartite graphs into closed trails ⋮ Cycle decompositions of complete multigraphs ⋮ Closed trail decompositions of some classes of regular graphs ⋮ Decompositions of pseudographs into closed trails of even sizes ⋮ Irregularity strength of digraphs

This page was built for publication: Packing Digraphs with Directed Closed Trails