The following pages link to On self‐complementation (Q3714119):
Displaying 13 items.
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- A note on an embedding problem in transitive tournaments (Q965937) (← links)
- Generalized complementation (Q1072574) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
- Complete families of graphs (Q2706951) (← links)
- Mutual placement of a kind of digraph (Q2774263) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q2816145) (← links)
- Self-complementary hypergraphs and their self-complementing permutations (Q3439451) (← links)
