A note on t-complementing permutations for graphs

DOI10.1016/J.IPL.2009.10.004zbMATH Open1197.05139OpenAlexW2055944593MaRDI QIDQ990101FDOQ990101

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

• Title not available (Why is that?)
• Selbstkomplementäre Graphen
• Title not available (Why is that?)
• On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
• Decomposition of \(K_n\) into subgraphs of prescribed type
• Title not available (Why is that?)
• On cyclically \(K\)-complementary graphs
• The divisibility theorem for isomorphic factorizations of complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost \(t\)-complementary uniform hypergraphs
• Cyclically \(t\)-complementary uniform hypergraphs
• On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs
• Cyclic partitions of complete and almost complete 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)