The sufficiency of the divisibility condition for 6 × 2kdivides complete tripartite graphK(m, n, s)

DOI10.1080/09720529.2016.1191173zbMath1495.05251OpenAlexW2421931248MaRDI QIDQ5069795

Zijian Min, Jinchen Yang, Huiming Duan

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

zbMATH Keywords

complete tripartite graphisomorphic factorization

Mathematics Subject Classification ID

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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• An isomorphic factorization of the complete graph
• Isomorphic factorizations X: Unsolved problems
• On the gracefulness of the graph P 2m,2n
• The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors

This page was built for publication: The sufficiency of the divisibility condition for 6 × 2^kdivides complete tripartite graphK(m, n, s)