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

DOI10.1080/09720529.2014.1001588zbMath1495.05250OpenAlexW2311244701MaRDI QIDQ5069712

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

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• 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
• An isomorphic factorization of the complete graph
• Isomorphic factorizations X: Unsolved problems
• On the gracefulness of the graph P 2m,2n

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