Homogeneous factorisations of complete multipartite graphs
DOI10.1016/J.DISC.2005.09.034zbMATH Open1110.05082OpenAlexW1986708719WikidataQ56987779 ScholiaQ56987779MaRDI QIDQ864129FDOQ864129
Authors: Michael Giudici, Cai Heng Li, Primož Potočnik, Cheryl E. Praeger 
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.034
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- The rational function analogue of a question of Schur and exceptionality of permutation representations
- On isomorphisms of finite Cayley graphs---a survey
- Title not available (Why is that?)
- Retracts of strong products of graphs
- On partitioning the orbitals of a transitive permutation group
- Factorizations of primitive permutation groups
- The existence of selfcomplementary circulant graphs
- On regular and strongly-regular self-complementary graphs
- On Sylow Subgraphs of Vertex-Transitive Self-Complementary Graphs
- Non-Cayley-isomorphic self-complementary circulant graphs
- Title not available (Why is that?)
- On orbital partitions and exceptionality of primitive permutation groups
- All self-complementary symmetric graphs
- Constructions of self-complementary circulants with no multiplicative isomorphisms
- Homogeneous factorisations of graph products
- Almost self-complementary circulant graphs.
- Homogeneous factorisations of graphs and digraphs
- Self-complementary symmetric graphs
- Isomorphic Factorisations. I: Complete Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Circulant homogeneous factorizations of complete graphs
- Constructing homogeneous factorisations of complete graphs and digraphs
- Cyclic and dihedral 1-factorizations of multipartite graphs
- Countable homogeneous multipartite graphs
- Sharply transitive 1-factorizations of complete multipartite graphs
- Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime
- Self-complementary two-graphs and almost self-complementary double covers
- Common circulant homogeneous factorisations of the complete digraph
- Brick assignments and homogeneously almost self-complementary graphs
- Homogeneous factorisations of graphs and digraphs
- On finite edge-primitive and edge-quasiprimitive graphs
- Arc‐transitive homogeneous factorizations and affine planes
- Homogeneously almost self-complementary graphs
- Homogeneous factorisations of complete graphs with edge-transitive factors
- Edge-transitive homogeneous factorizations of complete uniform hypergraphs
- Complete multipartite graphs which are isomorphic to elementary abelian \(p\)-group Cayley homogeneous factorization
- Homogeneous factorisations of graph products
- Title not available (Why is that?)
- Homogeneous factorisations of Johnson graphs
- Edge-transitive almost self-complementary graphs
- On almost self-complementary graphs
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity
- An unusual decomposition of a complete 7-partite graph of order 28
Uses Software
This page was built for publication: Homogeneous factorisations of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864129)
