The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2kisomorphic factors

DOI10.1080/09720529.2014.1001588MaRDI QIDQ5069712zbMATH OpenOpenAlexFDO

Authors 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.2014.1001588

zbMATH Keywords

factorizationisomorphiccomplete tripartite graph

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)

Recommendations

• 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
• scientific article; zbMATH DE number 4012305
• Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diam\-eter
• \(P_9\)-factorization of complete bipartite graph
• A class of large sets of \(K_{1,3}\)-factors of complete tripartite graphs
• \(\widehat K_{p,q}\)-factorization of symmetric complete tripartite digraphs
• scientific article; zbMATH DE number 3959482
• \(\overline S_k\)-factorization of symmetric complete tripartite digraphs
• scientific article; zbMATH DE number 7283879
• Two classes of large sets of graph factors of complete tripartite graphs

Cites work

• scientific article; zbMATH DE number 3838069 (Why is no real title available?)
• 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 graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure

Cited in

(2)

• The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)
• scientific article; zbMATH DE number 7283879 (Why is no real title available?)

This page was built for publication: The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors

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