A note on \(t\)-complementing permutations for graphs
From MaRDI portal
Publication:990101
DOI10.1016/j.ipl.2009.10.004zbMath1197.05139OpenAlexW2055944593MaRDI QIDQ990101
Małgorzata Zwonek, Lech Adamus, Artur Szymański, Beata Orchel, Adam Paweł Wojda
Publication date: 2 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.004
Related Items (3)
Cyclic partitions of complete and almost complete uniform hypergraphs ⋮ Almost \(t\)-complementary uniform hypergraphs ⋮ Cyclically \(t\)-complementary uniform hypergraphs
Cites Work
- Decomposition of \(K_n\) into subgraphs of prescribed type
- On cyclically \(K\)-complementary graphs
- On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
- Selbstkomplementäre Graphen
- The divisibility theorem for isomorphic factorizations of complete graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on \(t\)-complementing permutations for graphs