On almost self-complementary graphs

DOI10.1016/j.disc.2005.11.003zbMath1085.05051OpenAlexW2048219129MaRDI QIDQ817761

Primož Potočnik, Mateja Šajna

Publication date: 20 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.003

zbMATH Keywords

homogeneous factorizationhomogeneously almost self-complementary graphisomorphic factorizationnon-cyclically almost self-complementary circulant graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Self-complementary two-graphs and almost self-complementary double covers ⋮ Edge-transitive almost self-complementary graphs ⋮ Brick assignments and homogeneously almost self-complementary graphs ⋮ More on almost self-complementary graphs ⋮ Steiner almost self-complementary graphs and halving near-Steiner triple systems

Cites Work

• The composition of graphs
• Homogeneous factorisations of complete multipartite graphs
• Almost self-complementary circulant graphs.
• The existence of selfcomplementary circulant graphs
• On regular and strongly-regular self-complementary graphs
• Homogeneous factorisations of graphs and digraphs
• On Sylow Subgraphs of Vertex-Transitive Self-Complementary Graphs
• On partitioning the orbitals of a transitive permutation group
• Unnamed Item
• Unnamed Item