Decomposition of complete Tripartite graphs into triangles and claws
From MaRDI portal
Publication:6595726
DOI10.30504/JIMS.2024.417929.1148zbMATH Open1544.05067MaRDI QIDQ6595726
Shanmugasundaram Priyadarsini, A. Muthusamy
Publication date: 30 August 2024
Published in: Journal of the Iranian Mathematical Society (Search for Journal in Brave)
Paths and cycles (05C38) Deformation quantization, star products (53D55) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete graphs into triangles and claws
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Further decompositions of complete tripartite graphs into 5-cycles
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
- Decomposition of complete graphs into cycles and stars
- On decomposing complete tripartite graphs into 5-cycles
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposition of complete tripartite graphs into cycles and paths of length three
This page was built for publication: Decomposition of complete Tripartite graphs into triangles and claws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595726)