Cyclic partitions of complete and almost complete uniform hypergraphs
DOI10.7151/dmgt.2303zbMath1492.05106OpenAlexW3007069731MaRDI QIDQ2151208
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2303
uniform hypergraphalmost self-complementary hypergraph\((t, k)\)-complementing permutationcyclically \(t\)-complementary hypergraph
Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost self-complementary 3-uniform hypergraphs
- Cyclically \(t\)-complementary uniform hypergraphs
- Lucas' theorem for prime powers
- Generating self-complementary uniform hypergraphs
- A note on \(t\)-complementing permutations for graphs
- Almost self-complementary uniform hypergraphs
- Graphs self-complementary in \(K_ n-e\)
- On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
- Cyclic partitions of complete uniform hypergraphs
- Almost \(t\)-complementary uniform hypergraphs
- Selbstkomplementäre Graphen
- Self-complementary hypergraphs
- A note on k-uniform self-complementary hypergraphs of given order
- Self-complementary graphs
This page was built for publication: Cyclic partitions of complete and almost complete uniform hypergraphs
