On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs

DOI10.1016/0012-365X(94)00082-TzbMath0858.05088OpenAlexW2000954682MaRDI QIDQ1916377

Jose M. Bernaldez

Publication date: 11 March 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00082-t

zbMATH Keywords

permutationfactorizationisomorphism\(k\)-complementary graph\(k\)-complementing permutation

Mathematics Subject Classification ID

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

Related Items (4)

Cyclic partitions of complete and almost complete uniform hypergraphs ⋮ Almost \(t\)-complementary uniform hypergraphs ⋮ Cyclically \(t\)-complementary uniform hypergraphs ⋮ A note on \(t\)-complementing permutations for graphs

Cites Work

• On cyclically \(K\)-complementary graphs
• The divisibility theorem for isomorphic factorizations of complete graphs

This page was built for publication: On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs