Homogeneous factorisations of graphs and digraphs (Q2581455): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56987810, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4552256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous factorisations of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost self-complementary circulant graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fintte two-arc transitive graphs admitting a suzuki simple group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem and self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous factorisations of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orbital partitions and exceptionality of primitive permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rational function analogue of a question of Schur and exceptionality of permutation representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphic Factorisations. I: Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphic factorizations X: Unsolved problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of self-complementary circulants with no multiplicative isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-complementary vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning the orbitals of a transitive permutation group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Cayley-isomorphic self-complementary circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging semisymmetric and half-arc-transitive actions on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-complementary strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sylow Subgraphs of Vertex-Transitive Self-Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All self-complementary symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite transitive permutation groups and bipartite vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular and strongly-regular self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-complementary symmetric graphs / rank
 
Normal rank

Latest revision as of 13:53, 11 June 2024

scientific article
Language Label Description Also known as
English
Homogeneous factorisations of graphs and digraphs
scientific article

    Statements

    Homogeneous factorisations of graphs and digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    Vertex-transitive graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers