A note on t-complementing permutations for graphs

DOI10.1016/J.IPL.2009.10.004MaRDI QIDQ990101zbMATH OpenOpenAlexFDO

Authors Lech Adamus, Beata Orchel, Artur Szymański, Małgorzata Zwonek, 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

zbMATH Keywords

graph algorithmscombinatorial problemsself-complementary graphself-complementing permutation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 734478 (Why is no real title available?)
• scientific article; zbMATH DE number 1109416 (Why is no real title available?)
• scientific article; zbMATH DE number 3222646 (Why is no real title available?)
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• Decomposition of \(K_n\) into subgraphs of prescribed type
• On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
• On cyclically \(K\)-complementary graphs
• Selbstkomplementäre Graphen
• The divisibility theorem for isomorphic factorizations of complete graphs

Cited in

(7)

• scientific article; zbMATH DE number 734478 (Why is no real title available?)
• scientific article; zbMATH DE number 1109416 (Why is no real title available?)
• On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
• Cyclic partitions of complete and almost complete uniform hypergraphs
• Cyclically \(t\)-complementary uniform hypergraphs
• Almost \(t\)-complementary uniform hypergraphs
• On t-homogeneous permutation sets

This page was built for publication: A note on \(t\)-complementing permutations for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990101)