Edge-disjoint open trails in complete bipartite multigraphs

DOI10.1007/S00373-010-0904-2MaRDI QIDQ604666zbMATH OpenOpenAlexFDO

Authors Sylwia Cichacz, Agnieszka Görlich

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

bipartite graphdecompositionmultigraphopen 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)

Recommendations

• Decompositions of complete multigraphs into open trails
• Decomposition of complete bipartite graphs into open trails
• Open trails in digraphs
• scientific article; zbMATH DE number 5917766
• Decomposition of bipartite graphs into closed trails

Cites work

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

Cited in

(5)

• Arbitrary decompositions into open and closed trails
• The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
• Decomposition of bipartite graphs into closed trails
• Open trails in digraphs
• Decompositions of complete multigraphs into open trails

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

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