Isomorphic factorizations X: Unsolved problems

DOI10.1002/JGT.3190090105MaRDI QIDQ4726287zbMATH OpenOpenAlexWikidataFDO

Authors Frank Harary, R. W. Robinson

Publication date 1985

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190090105

zbMATH Keywords

isomorphic factorizations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 4105006
• scientific article; zbMATH DE number 3867380
• scientific article; zbMATH DE number 1792669
• 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 26476

Cites work

• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 3596859 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• COVERING AND PACKING IN GRAPHS, I.
• Generalized Ramsey theory. IX: Isomorphic factorizations. IV: Isomorphic Ramsey numbers
• On Edge-Colorability of Cartesian Products of Graphs^*
• Regular Graphs of High Degree are 1-Factorizable

Cited in

(15)

• On partitioning the orbitals of a transitive permutation group
• Isomorphic factorization, the Kronecker product and the line digraph
• The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)
• Symmetric edge-decompositions of hypercubes
• Homogeneous factorisations of graphs and digraphs
• 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
• Parallel concepts in graph theory
• Homogeneous factorisations of complete graphs with edge-transitive factors
• Minimal regular 2-graphs and applications
• Homogeneous factorisations of graph products
• Extension of de Bruijn graph and Kautz graph
• Transitive decompositions of graph products: rank 3 grid type
• The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors
• Primitive decompositions of Johnson graphs
• Decompositions of triangle-free 5-regular graphs into paths of length five

This page was built for publication: Isomorphic factorizations X: Unsolved problems

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