Isomorphic Factorisations. I: Complete Graphs
From MaRDI portal
Publication:4159099
Cited in
(21)- Packing of graphs and permutations -- a survey
- Least Common Multiple of a Cycle and a Star
- 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
- scientific article; zbMATH DE number 4105006 (Why is no real title available?)
- Homogeneous factorisations of graphs and digraphs
- PBIB-designs with \(m= 1, 2, 3, 4\) and \(\lfloor\frac{p}{2}\rfloor\) associated classes arising from \(\gamma_{cc}\)-sets of some special kind of graphs
- 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
- Homogeneous factorisations of graph products
- Extension of de Bruijn graph and Kautz graph
- 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)