Arbitrary decompositions into open and closed trails

DOI10.1016/j.disc.2008.03.004zbMath1213.05209OpenAlexW2101379605MaRDI QIDQ1024460

Yoshimi Egawa, Sylwia Cichacz, Mariusz Woźniak

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.004

zbMATH Keywords

decompositiontrail

Mathematics Subject Classification ID

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

Related Items (1)

Edge-disjoint open trails in complete bipartite multigraphs

Cites Work

• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• Unnamed Item

This page was built for publication: Arbitrary decompositions into open and closed trails