Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

DOI10.1002/jcd.20304zbMath1242.05171OpenAlexW2091233183MaRDI QIDQ2896013

Emine Şule Yazıcı, Benjamin R. Smith, Selda Küçükçifçi

Publication date: 13 July 2012

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/5551

zbMATH Keywords

ADCTgraph decompositionclosed trails

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Cites Work

• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Packing Circuits into K_N
• Closed trail decompositions of complete equipartite graphs
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of Complete Bipartite Even Graphs into Closed Trails

This page was built for publication: Decomposing complete multipartite graphs into closed trails of arbitrary even lengths