Closed trail decompositions of some classes of regular graphs

DOI10.1016/J.DISC.2011.12.015MaRDI QIDQ764903zbMATH OpenOpenAlexFDO

Authors P. Paulraja, S. Sampath Kumar

Publication date 16 March 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

tensor productHamilton cycleintersection graphwreath productclosed trail decomposition

Mathematics Subject Classification ID

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

Recommendations

• 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
• On complete tripartite graphs arbitrarily decomposable into closed trails
• Decomposition of bipartite graphs into closed trails

Cites work

• scientific article; zbMATH DE number 4150168 (Why is no real title available?)
• scientific article; zbMATH DE number 5177321 (Why is no real title available?)
• scientific article; zbMATH DE number 1343531 (Why is no real title available?)
• scientific article; zbMATH DE number 1096962 (Why is no real title available?)
• scientific article; zbMATH DE number 5879550 (Why is no real title available?)
• A method in graph theory
• A note on Hamiltonian circuits
• A textbook of graph theory
• Balanced incomplete block designs and related designs
• Closed trail decompositions of complete equipartite graphs
• Cycle decompositions of complete multigraphs
• Cycle decompositions of complete multigraphs
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decompositions of complete multipartite graphs into cycles of even length
• Graph theory
• Packing Digraphs with Directed Closed Trails
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
• Packing circuits into \(K_N\).
• Resolvable even cycle decompositions of the tensor product of complete graphs
• \(C_5\)-decompositions of the tensor product of complete graphs
• \(C_7\)-decompositions of the tensor product of complete graphs
• \(C_{p}\)-decompositions of some regular graphs

Cited in

(10)

• Decompositions of complete equipartite graphs into cycles of lengths 3 and 6
• \(p^2\)-cycle decompositions of the tensor product of complete graphs
• Closed trail decompositions of complete equipartite graphs
• 2p-cycle decompositions of some regular graphs and digraphs
• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Sparse graphs which decompose into closed trails of arbitrary lengths
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• Decompositions of pseudographs into closed trails of even sizes
• On planar graphs arbitrarily decomposable into closed trails
• scientific article; zbMATH DE number 5917766 (Why is no real title available?)

This page was built for publication: Closed trail decompositions of some classes of regular graphs

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