The following pages link to Subgraph complementation (Q2182091):
Displaying 8 items.
- Recognizing some complementary products (Q389934) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- (Q3976605) (← links)
- Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum (Q6132854) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Algorithms for subgraph complementation to some classes of graphs (Q6663515) (← links)