scientific article; zbMATH DE number 7057478
From MaRDI portal
Publication:5377016
zbMath1411.05228MaRDI QIDQ5377016
T. Sivakaran, R. S. Manikandan, P. Paulraja
Publication date: 23 May 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p107.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs
- Closed trail decompositions of some classes of regular graphs
- Modified group divisible designs with block size 5 and even index
- Hamilton cycle decompositions of the tensor product of complete multipartite graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- Balanced incomplete block designs and related designs
- Modified group divisible designs with block size 4 and \(\lambda=1\)
- An application of modified group divisible designs
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Factorizations of product graphs into cycles of uniform length
- The Oberwolfach problem and factors of uniform odd length cycles
- Modified group divisible designs with block size 5 and \(\lambda=1\)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decompositions of complete multipartite graphs into cycles of even length
- Resolvable even cycle 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
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
- Cycle Frames of Complete Multipartite Multigraphs - III
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into cycles of length2p
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- A Complete Solution to the Existence of ‐Cycle Frames of Type
This page was built for publication: