Isomorphic Factorisations. I: Complete Graphs
From MaRDI portal
Publication:4159099
DOI10.2307/1997735zbMATH Open0381.05044OpenAlexW4238093017MaRDI QIDQ4159099FDOQ4159099
Authors: Frank Harary, R. W. Robinson, Nicholas Wormald
Publication date: 1978
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1997735
Cited In (21)
- Title not available (Why is that?)
- Least Common Multiple of a Cycle and a Star
- Packing of graphs and permutations -- a survey
- Designs associated with maximum independent sets of a graph
- Isomorphic factorizations VIII: Bisectable trees
- Combinatorial cube packings in the cube and the torus
- Isomorphic factorization, the Kronecker product and the line digraph
- The complete graph \(t\)-packings and \(t\)-coverings
- Title not available (Why is that?)
- Homogeneous factorisations of graphs and digraphs
- Parallel concepts in graph theory
- Factorial regular representation of groups in complete graphs
- Homogeneous factorisations of complete graphs with edge-transitive factors
- Greatest common divisors and least common multiples of graphs
- Extension of de Bruijn graph and Kautz graph
- Homogeneous factorisations of graph products
- Graph factors and factorization: 1985--2003: a survey
- Chromatically supremal decompositions of graphs
- Isomorphic factorisations V: Directed graphs
- Primitive decompositions of Johnson graphs
- Homogeneous factorisations of complete multipartite graphs
This page was built for publication: Isomorphic Factorisations. I: Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159099)