On self‐complementation
From MaRDI portal
Recommendations
Cited in
(16)- Generalized complementation
- Embedding graphs of small size
- Embedding digraphs of small size
- Packing of graphs and permutations -- a survey
- On self-complementary supergraphs of (n,n)-graphs
- On embedding graphs with bounded sum of size and maximum degree
- Labeled 2-packings of trees
- Complete families of graphs
- Mutual placement of a kind of digraph
- On self-complementary supergraphs of (\(n,n\))-graphs
- Why graph-theoretic conditional semivalidities tend to be self-complementary
- Self-complementary hypergraphs and their self-complementing permutations
- scientific article; zbMATH DE number 653264 (Why is no real title available?)
- scientific article; zbMATH DE number 1475098 (Why is no real title available?)
- Fixed-point-free embeddings of digraphs with small size
- A note on an embedding problem in transitive tournaments
This page was built for publication: On self‐complementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714119)