Packing Digraphs with Directed Closed Trails
From MaRDI portal
Recommendations
- Packing paths in digraphs
- Packing closed trails into dense graphs.
- scientific article; zbMATH DE number 3968612
- scientific article; zbMATH DE number 4127236
- On packable digraphs
- Packings of the complete directed graph with \(m\)-circuits
- scientific article; zbMATH DE number 3981226
- Packing paths in complete graphs
- Packing circuits in eulerian digraphs
- Packing Euler graphs with traces
Cited in
(16)- Approximability of Packing Disjoint Cycles
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Approximability of packing disjoint cycles
- Closed trail decompositions of complete equipartite graphs
- Cycle decompositions of complete multigraphs
- Edge-disjoint open trails in complete bipartite multigraphs
- Walks, partitions, and normal ordering
- scientific article; zbMATH DE number 3861185 (Why is no real title available?)
- Closed trail decompositions of some classes of regular graphs
- Packing directed cycles efficiently
- How to Pack Directed Acyclic Graphs into Small Blocks
- Decompositions of pseudographs into closed trails of even sizes
- Irregularity strength of digraphs
- On planar graphs arbitrarily decomposable into closed trails
- scientific article; zbMATH DE number 15867 (Why is no real title available?)
- Decomposition of bipartite graphs into closed trails
This page was built for publication: Packing Digraphs with Directed Closed Trails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796722)
