Edge-disjoint open trails in complete bipartite multigraphs

DOI10.1007/S00373-010-0904-2zbMath1230.05232OpenAlexW2036296291MaRDI QIDQ604666

Sylwia Cichacz, Agnieszka Goerlich

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0904-2

zbMATH Keywords

multigraphdecompositionbipartite graphopen trail

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cites Work

• Arbitrary decompositions into open and closed trails
• Packing Circuits into K_N
• Open trails in digraphs
• Decomposition of complete bipartite graphs into open trails
• Packing Digraphs with Directed Closed Trails
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails

This page was built for publication: Edge-disjoint open trails in complete bipartite multigraphs