Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

DOI10.1002/JCD.20304MaRDI QIDQ2896013zbMATH OpenOpenAlexFDO

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

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

ADCTclosed trailsgraph decomposition

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Cites work

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

Cited in

(6)

• Sparse graphs which decompose into closed trails of arbitrary lengths
• On planar graphs arbitrarily decomposable into closed trails
• scientific article; zbMATH DE number 5917766 (Why is no real title available?)
• Decomposition of complete bipartite graphs into open trails
• scientific article; zbMATH DE number 5177321 (Why is no real title available?)
• Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails

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

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