The sufficiency of the divisibility condition for 6 2ᵏ divides complete tripartite graph K(m, n, s)

DOI10.1080/09720529.2016.1191173zbMATH Open1495.05251OpenAlexW2421931248MaRDI QIDQ5069795FDOQ5069795

Authors: Huiming Duan, Zijian Min, Jinchen Yang 

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2016.1191173

Recommendations

• scientific article; zbMATH DE number 1347007
• scientific article; zbMATH DE number 617585
• The isomorphic factorization of complete tripartite graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure
• On decomposing complete tripartite graphs into 5-cycles
• scientific article; zbMATH DE number 3937213

zbMATH Keywords

complete tripartite graphisomorphic factorization

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• An isomorphic factorization of the complete graph
• Isomorphic factorizations X: Unsolved problems
• On the gracefulness of the graph \(P_{2m,2n}\)
• Title not available (Why is that?)
• The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors

Cited In (2)

• Title not available (Why is that?)
• The isomorphic factorization of complete tripartite graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure

This page was built for publication: The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)

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